On the public citation graph

The interchange graph of a finite graph

https://doi.org/10.1007/bf01904834

0 signed · 115 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1090/coll/038openalex-snapshot

Theory of Graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.20509openalex-snapshot

Equivalence of four descriptions of generalized line graphs

inferred← citeshttps://doi.org/10.1002/jgt.22775openalex-snapshot

On the edge‐biclique graph and the iterated edge‐biclique operator

inferred← citeshttps://doi.org/10.1002/jgt.3190020308openalex-snapshot

Some sufficient conditions for the existence of a 1‐factor

inferred← citeshttps://doi.org/10.1002/jgt.3190030402openalex-snapshot

A bibliography of graph equations

inferred← citeshttps://doi.org/10.1002/jgt.3190040210openalex-snapshot

Line‐graphical degree sequences

inferred← citeshttps://doi.org/10.1002/jgt.3190120218openalex-snapshot

Characterizations of second iterated line graphs

inferred← citeshttps://doi.org/10.1002/jgt.3190130406openalex-snapshot

Path graphs

inferred← citeshttps://doi.org/10.1002/jgt.3190130502openalex-snapshot

Matching cutsets in graphs

inferred← citeshttps://doi.org/10.1002/jgt.3190140506openalex-snapshot

Which line‐graphs are perfectly orderable?

inferred← citeshttps://doi.org/10.1002/jgt.3190180308openalex-snapshot

A common generalization of line graphs and clique graphs

inferred← citeshttps://doi.org/10.1006/jctb.1998.1823openalex-snapshot

Onk-Critical Connected Line Graphs

inferred← citeshttps://doi.org/10.1006/jctb.2001.2040openalex-snapshot

All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected

inferred← citeshttps://doi.org/10.1007/3-540-60618-1_64openalex-snapshot

A dynamic algorithm for line graph recognition

inferred← citeshttps://doi.org/10.1007/978-1-4613-8994-1_16openalex-snapshot

Some Recent Results on Signed Graphs with Least Eigenvalues ≥ -2

inferred← citeshttps://doi.org/10.1007/978-3-030-81386-4_1openalex-snapshot

Fundamentals of Line Graphs

inferred← citeshttps://doi.org/10.1007/978-3-030-81386-4_10openalex-snapshot

Fundamentals of Line Digraphs

inferred← citeshttps://doi.org/10.1007/978-3-030-81386-4_11openalex-snapshot

Characterizations of Line Digraphs

inferred← citeshttps://doi.org/10.1007/978-3-030-81386-4_3openalex-snapshot

Characterizations of Line Graphs

inferred← citeshttps://doi.org/10.1007/978-3-031-83438-7_26openalex-snapshot

Forbidden Induced Subgraphs in Iterative Higher Order Line Graphs

inferred← citeshttps://doi.org/10.1007/978-3-032-00281-5_14openalex-snapshot

The Edge-Intersection Graph of Induced Paths in a Graph

inferred← citeshttps://doi.org/10.1007/978-3-319-11182-7_1openalex-snapshot

Vector Weights and Dual Graphs: An Emphasis on Connections in Brain Network Analysis

inferred← citeshttps://doi.org/10.1007/978-3-319-28186-5_2openalex-snapshot

Transformations of Digraphs Viewed as Intersection Digraphs

inferred← citeshttps://doi.org/10.1007/978-3-642-22321-1_46openalex-snapshot

On the Representability of Line Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-33122-0_6openalex-snapshot

Estimating Population Size via Line Graph Reconstruction

inferred← citeshttps://doi.org/10.1007/978-981-96-2216-0_24openalex-snapshot

Consensus Relations of Nodal Networks and Edge Networks: From the Spectral Perspective

inferred← citeshttps://doi.org/10.1007/bf01071768openalex-snapshot

Star-shape, Radon number, and minty graphs

inferred← citeshttps://doi.org/10.1007/bf02986664openalex-snapshot

Iteratedk-line graphs

inferred← citeshttps://doi.org/10.1007/bf03322213openalex-snapshot

Infinite ϕ-periodic graphs

inferred← citeshttps://doi.org/10.1007/bf03353014openalex-snapshot

Recognizing Intersection Graphs of Linear Uniform Hypergraphs

inferred← citeshttps://doi.org/10.1007/bfb0059419openalex-snapshot

Derived graphs with derived complements

inferred← citeshttps://doi.org/10.1007/bfb0060111openalex-snapshot

Incidence patterns of graphs and complexes

inferred← citeshttps://doi.org/10.1007/bfb0067365openalex-snapshot

Line graphs of triangleless graphs and iterated clique graphs

inferred← citeshttps://doi.org/10.1007/bfb0092290openalex-snapshot

The minimal forbidden subgraphs for generalized line-graphs

inferred← citeshttps://doi.org/10.1007/s00220-011-1245-6openalex-snapshot

Twistor Theory on a Finite Graph

inferred← citeshttps://doi.org/10.1007/s00373-010-0981-2openalex-snapshot

Automorphic Decompositions of Graphs

inferred← citeshttps://doi.org/10.1007/s00373-011-1073-7openalex-snapshot

Reconstructing a Graph from its Arc Incidence Graph

inferred← citeshttps://doi.org/10.1007/s00574-025-00475-2openalex-snapshot

Some Spectral Properties of Oriented Line Graphs

inferred← citeshttps://doi.org/10.1007/s10587-008-0051-6openalex-snapshot

Minimal claw-free graphs

inferred← citeshttps://doi.org/10.1007/s10852-014-9251-2openalex-snapshot

ILIGRA: An Efficient Inverse Line Graph Algorithm

inferred← citeshttps://doi.org/10.1007/s10910-015-0510-xopenalex-snapshot

Enumerating and indexing many-body intramolecular interactions: a graph theoretic approach

inferred← citeshttps://doi.org/10.1007/s13226-024-00568-6openalex-snapshot

On the line graph structure of the cozero-divisor graph of a commutative ring

inferred← citeshttps://doi.org/10.1016/0012-365x(81)90001-7openalex-snapshot

Further results on graph equations for line graphs and n-th power graphs

inferred← citeshttps://doi.org/10.1016/0020-0190(73)90029-xopenalex-snapshot

A max {m,n} algorithm for determining the graph H from its line graph G

inferred← citeshttps://doi.org/10.1016/0024-3795(77)90027-1openalex-snapshot

On graphs whose least eigenvalue exceeds − 1 − √2

inferred← citeshttps://doi.org/10.1016/0095-8956(80)90074-xopenalex-snapshot

On maximal independent sets of vertices in claw-free graphs

inferred← citeshttps://doi.org/10.1016/0166-218x(88)90006-6openalex-snapshot

Branching in graphs and molecules

inferred← citeshttps://doi.org/10.1016/j.akcej.2018.08.006openalex-snapshot

The distinguishing number and the distinguishing index of line and graphoidal graph(s)

inferred← citeshttps://doi.org/10.1016/j.dam.2013.04.013openalex-snapshot

Characterization of classical graph classes by weighted clique graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2019.06.002openalex-snapshot

Color-line and proper color-line graphs

inferred← citeshttps://doi.org/10.1016/j.disc.2022.112920openalex-snapshot

Index of parameters of iterated line graphs

inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103479openalex-snapshot

Characterizations of line graphs in signed and gain graphs

inferred← citeshttps://doi.org/10.1016/j.ejor.2020.07.001openalex-snapshot

Finding the root graph through minimum edge deletion

inferred← citeshttps://doi.org/10.1016/j.jcss.2016.04.002openalex-snapshot

Fast processing of graph queries on a large database of small and medium-sized data graphs

inferred← citeshttps://doi.org/10.1016/j.jfranklin.2022.05.016openalex-snapshot

Improved results on distributed observer-based positive edge consensus

inferred← citeshttps://doi.org/10.1016/j.knosys.2025.114712openalex-snapshot

HyperLAC: Hypergraph-based Large-scale Alert Classification with spatial-temporal context enhancement

inferred← citeshttps://doi.org/10.1016/j.laa.2014.03.047openalex-snapshot

From finite line graphs to infinite derived signed graphs

inferred← citeshttps://doi.org/10.1016/j.physa.2015.10.109openalex-snapshot

Degree distribution and assortativity in line graphs of complex networks

inferred← citeshttps://doi.org/10.1016/s0021-9800(70)80019-9openalex-snapshot

Characterizations of derived graphs

inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70883-5openalex-snapshot

Recognizing Intersection Patterns

inferred← citeshttps://doi.org/10.1016/s0195-6698(13)80037-6openalex-snapshot

A Characterization of Signed Graphs Represented by Root System D℞

inferred← citeshttps://doi.org/10.1016/s0195-6698(82)80029-2openalex-snapshot

Intersection Graphs of k-uniform Linear Hypergraphs

inferred← citeshttps://doi.org/10.1016/s0195-6698(87)80024-0openalex-snapshot

Signed Graphs Represented by D∞

inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73649-1openalex-snapshot

References

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00228-0openalex-snapshot

On the number of inductively minimal geometries

inferred← citeshttps://doi.org/10.1016/s0924-6509(09)70352-6openalex-snapshot

WITHDRAWN: References

inferred← citeshttps://doi.org/10.1017/fms.2025.10110openalex-snapshot

Forbidden induced subgraphs for graphs and signed graphs with eigenvalues bounded from below

inferred← citeshttps://doi.org/10.1017/s0017089500002652openalex-snapshot

Minimal line graphs

inferred← citeshttps://doi.org/10.1017/s0963548325100278openalex-snapshot

Beyond the classification theorem of Cameron, Goethals, Seidel, and Shult

inferred← citeshttps://doi.org/10.1023/a:1020853410145openalex-snapshot

Modeling Costs of Turns in Route Planning

inferred← citeshttps://doi.org/10.1023/a:1021271615909openalex-snapshot

Maximum common subgraph isomorphism algorithms for the matching of chemical structures

inferred← citeshttps://doi.org/10.1051/ro/2018087openalex-snapshot

Efficient algorithms under dynamic graphs to solve the Capacitated Arc Routing Problem with feasible sparse graph

inferred← citeshttps://doi.org/10.1063/1.5041652openalex-snapshot

On 3-step Hamiltonicity of certain graphs

inferred← citeshttps://doi.org/10.1080/00029890.1972.11992979openalex-snapshot

Thirteen Colorful Variations on Guthrie's Four-Color Conjecture

inferred← citeshttps://doi.org/10.1080/01630563.2023.2262819openalex-snapshot

Higher Order Difference Operators and Associated Relative Reproducing Kernel Hilbert Spaces

inferred← citeshttps://doi.org/10.1080/09728600.2022.2093146openalex-snapshot

New results and open problems in line graphs

inferred← citeshttps://doi.org/10.1088/1367-2630/18/11/113056openalex-snapshot

Coupled dynamics of node and link states in complex networks: a model for language competition

inferred← citeshttps://doi.org/10.1090/s0002-9939-1971-0289349-5openalex-snapshot

Locally Finite Self-Interchange Graphs

inferred← citeshttps://doi.org/10.1103/physreve.86.066113openalex-snapshot

Dynamics of link states in complex networks: The case of a majority rule

inferred← citeshttps://doi.org/10.1103/physreve.89.062802openalex-snapshot

Fragmentation transition in a coevolving network with link-state dynamics

inferred← citeshttps://doi.org/10.1109/acc.2016.7526572openalex-snapshot

Structural analysis and design of dynamic-flow networks: Implications in the brain dynamics

inferred← citeshttps://doi.org/10.1109/icdcs.2011.11openalex-snapshot

On the Dependencies between Source Neighbors in Optimally DoS-stable P2P Streaming Topologies

inferred← citeshttps://doi.org/10.1109/tac.2024.3386055openalex-snapshot

Nodal Consensus in Multiagent Systems With Edge Communications

inferred← citeshttps://doi.org/10.1109/tsmc.2017.2765678openalex-snapshot

Positive Edge Consensus of Complex Networks

inferred← citeshttps://doi.org/10.1109/wicom.2007.447openalex-snapshot

Joint Channel Assignment and Transmission Scheduling for Throughput Optimization in Wireless Mesh Networks - Further Study on a Partitioning Approach

inferred← citeshttps://doi.org/10.1111/tgis.12064openalex-snapshot

A New Framework for Solving the Spatial Network Problems Based on Line Graphs

inferred← citeshttps://doi.org/10.1134/s0081543814050083openalex-snapshot

Strictly Deza line graphs

inferred← citeshttps://doi.org/10.1137/0117062openalex-snapshot

The Change in the Least Eigenvalued of the Adjacency Matrix of a Graph Under Imbedding

inferred← citeshttps://doi.org/10.1137/1.9780898717105openalex-snapshot

Combinatorial Optimization

inferred← citeshttps://doi.org/10.1137/25m1751967openalex-snapshot

Intersections of Graphs and ${\chi }$-Boundedness

inferred← citeshttps://doi.org/10.1142/s2811007225500105openalex-snapshot

A fundamental theorem on graph operators

inferred← citeshttps://doi.org/10.1142/s2811007225500191openalex-snapshot

The quadrangle graph operator

inferred← citeshttps://doi.org/10.1145/321850.321853openalex-snapshot

An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph

inferred← citeshttps://doi.org/10.1155/s0161171204310094openalex-snapshot

Old and new generalizations of line graphs

inferred← citeshttps://doi.org/10.1186/1748-7188-8-17openalex-snapshot

Estimating population size via line graph reconstruction

inferred← citeshttps://doi.org/10.13001/ela.2020.5319openalex-snapshot

Tree Cover Number and Maximum Semidefinite Nullity of Some Graph Classes

inferred← citeshttps://doi.org/10.1305/ndjfl/1093888225openalex-snapshot

Forbidden subgraphs in terms of forbidden quantifiers.

inferred← citeshttps://doi.org/10.14419/gjma.v2i1.1489openalex-snapshot

Fundamental groups of iterated line graphs

inferred← citeshttps://doi.org/10.18297/etd/693openalex-snapshot

Avoiding, pretending, and querying : three combinatorial problems.

inferred← citeshttps://doi.org/10.2140/pjm.1968.27.393openalex-snapshot

On interchange graphs

inferred← citeshttps://doi.org/10.2140/pjm.1969.31.497openalex-snapshot

Infinite self-interchange graphs

inferred← citeshttps://doi.org/10.2298/aadm250525019sopenalex-snapshot

Recognizing signed line graphs with a single root

inferred← citeshttps://doi.org/10.2478/ausi-2021-0002openalex-snapshot

Confluence number of certain derivative graphs

inferred← citeshttps://doi.org/10.3389/fcpxs.2023.1304448openalex-snapshot

Language dynamics within adaptive networks: an agent-based approach of nodes and links coevolution

inferred← citeshttps://doi.org/10.3390/e28070805openalex-snapshot

Novel Support Routing Algorithm for Quantum Satellite Networks with Finite Quantum Memory

inferred← citeshttps://doi.org/10.3390/math12192995openalex-snapshot

Generalized Shortest Path Problem: An Innovative Approach for Non-Additive Problems in Conditional Weighted Graphs

inferred← citeshttps://doi.org/10.4018/978-1-5225-9380-5.ch002openalex-snapshot

An Introduction to Intersection Graphs

inferred← citeshttps://doi.org/10.4171/jems/974openalex-snapshot

Resolving Stanley's $e$-positivity of claw-contractible-free graphs

inferred← citeshttps://doi.org/10.4236/ojdm.2011.12012openalex-snapshot

Word-Representability of Line Graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1404.5468openalex-snapshot

Intersection Graphs: An Introduction

inferred← citeshttps://doi.org/10.48550/arxiv.1602.04698openalex-snapshot

A New Characterisation of Total Graphs

inferred← citeshttps://doi.org/10.5860/choice.39-4018openalex-snapshot

Combinatorial optimization: packing and covering

inferred← citeshttps://doi.org/10.70675/b6a1bb04z1604z4068z8a78zdade510ea6f6openalex-snapshot

Contribution aux graphes creux pour le problème de tournées sur arcs déterministe et robustes : théorie et algorithmes

inferred← citeshttps://doi.org/10.70675/d4c0774dz0db4z45f6z8d69zdbfb39064838openalex-snapshot

Algorithmes de graphes pour la découverte de la topologie d'un réseau énergétique par la connaissance de ses flots

inferred← citeshttps://doi.org/10.7151/dmgt.1691openalex-snapshot

Characterizations of the family of all generalized line graphs-finite and infinite- and classification of the family of all graphs whose least eigenvalues \ge - 2

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.