The interchange graph of a finite graph

DOI10.1007/BF01904834zbMATH Open0139.17203OpenAlexW2095107575WikidataQ56388850 ScholiaQ56388850MaRDI QIDQ5514299FDOQ5514299

Authors: Herbert S. Wilf, A. 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

zbMATH Keywords

topology

Cites Work

• Title not available (Why is that?)

Cited In (44)

• A characterization of signed graphs represented by root system \(D_ \infty\)
• New results and open problems in line graphs
• Minimal claw-free graphs
• Twistor theory on a finite graph
• Selected topics on Wiener index
• Title not available (Why is that?)
• Minimal line graphs
• Characterization of classical graph classes by weighted clique graphs
• From finite line graphs to infinite derived signed graphs
• Characterizations of line graphs in signed and gain graphs
• Confluence number of certain derivative graphs
• Iterated \(k\)-line graphs
• Claw-free strictly Deza graphs
• Equivalence of four descriptions of generalized line graphs
• Higher Order Difference Operators and Associated Relative Reproducing Kernel Hilbert Spaces
• Fast processing of graph queries on a large database of small and medium-sized data graphs
• On \(k\)-critical connected line graphs
• A dynamic algorithm for line graph recognition
• Locally Finite Self-Interchange Graphs
• On maximal independent sets of vertices in claw-free graphs
• Finding the root graph through minimum edge deletion
• On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
• Infinite \(\Phi\)-periodic graphs
• Further results on graph equations for line graphs and \(n\)-th power graphs
• Title not available (Why is that?)
• A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
• Star-shape, Radon number, and minty graphs
• All 4-connected line graphs of claw free graphs are Hamiltonian connected
• Color-line and proper color-line graphs
• Branching in graphs and molecules
• Intersection graphs of k-uniform linear hypergraphs
• Title not available (Why is that?)
• Strictly Deza line graphs
• Reconstructing a graph from its arc incidence graph
• Degree distribution and assortativity in line graphs of complex networks
• ILIGRA: an efficient inverse line graph algorithm
• Enumerating and indexing many-body intramolecular interactions: a graph theoretic approach
• Resolving Stanley's \(e\)-positivity of claw-contractible-free graphs
• Signed graphs represented by \(D_{\infty}\)
• On the number of inductively minimal geometries
• On the edge‐biclique graph and the iterated edge‐biclique operator
• A bibliography of graph equations
• Index of parameters of iterated line graphs
• Recognizing intersection graphs of linear uniform hypergraphs

This page was built for publication: The interchange graph of a finite graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5514299)