The interchange graph of a finite graph
From MaRDI portal
Publication:5514299
DOI10.1007/BF01904834zbMath0139.17203OpenAlexW2095107575WikidataQ56388850 ScholiaQ56388850MaRDI QIDQ5514299
Herbert S. Wilf, Arnoud C. M. van Rooij
Publication date: 1965
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01904834
Related Items (43)
Characterizations of line graphs in signed and gain graphs ⋮ Unnamed Item ⋮ Degree distribution and assortativity in line graphs of complex networks ⋮ Iterated \(k\)-line graphs ⋮ Fast processing of graph queries on a large database of small and medium-sized data graphs ⋮ Index of parameters of iterated line graphs ⋮ Branching in graphs and molecules ⋮ Infinite \(\Phi\)-periodic graphs ⋮ Recognizing intersection graphs of linear uniform hypergraphs ⋮ Claw-free strictly Deza graphs ⋮ Color-line and proper color-line graphs ⋮ Signed graphs represented by \(D_{\infty}\) ⋮ Star-shape, Radon number, and minty graphs ⋮ On \(k\)-critical connected line graphs ⋮ Reconstructing a graph from its arc incidence graph ⋮ On maximal independent sets of vertices in claw-free graphs ⋮ On the edge‐biclique graph and the iterated edge‐biclique operator ⋮ ILIGRA: an efficient inverse line graph algorithm ⋮ Higher Order Difference Operators and Associated Relative Reproducing Kernel Hilbert Spaces ⋮ New results and open problems in line graphs ⋮ A dynamic algorithm for line graph recognition ⋮ Further results on graph equations for line graphs and \(n\)-th power graphs ⋮ Intersection graphs of k-uniform linear hypergraphs ⋮ Characterization of classical graph classes by weighted clique graphs ⋮ Strictly Deza line graphs ⋮ Equivalence of four descriptions of generalized line graphs ⋮ Locally Finite Self-Interchange Graphs ⋮ Enumerating and indexing many-body intramolecular interactions: a graph theoretic approach ⋮ Minimal line graphs ⋮ Confluence number of certain derivative graphs ⋮ Twistor theory on a finite graph ⋮ A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G ⋮ On the number of inductively minimal geometries ⋮ A bibliography of graph equations ⋮ On graphs whose least eigenvalue exceeds \(-1-\sqrt2\) ⋮ Finding the root graph through minimum edge deletion ⋮ Minimal claw-free graphs ⋮ A characterization of signed graphs represented by root system \(D_ \infty\) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Resolving Stanley's \(e\)-positivity of claw-contractible-free graphs ⋮ All 4-connected line graphs of claw free graphs are Hamiltonian connected ⋮ From finite line graphs to infinite derived signed graphs
Cites Work
This page was built for publication: The interchange graph of a finite graph
