Two characterizations of interchange graphs of complete m-partite graphs
From MaRDI portal
Publication:1393416
DOI10.1016/0012-365X(74)90150-2zbMath0277.05136MaRDI QIDQ1393416
Publication date: 1974
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (5)
Iterated \(k\)-line graphs ⋮ Gallai graphs and anti-Gallai graphs ⋮ Triangle packings and transversals of some \(K_{4}\)-free graphs ⋮ Generalized line graphs: Cartesian products and complexity of recognition ⋮ Optimisation of quadratic forms associated with graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Eigenvalues of the adjacency matrix of cubic lattice graphs
- Further characterizations of cubic lattice graphs
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
- On the Line-Graph of the Complete Bigraph
- A characterization of cubic lattice graphs
- The uniqueness of the cubic lattice graph
This page was built for publication: Two characterizations of interchange graphs of complete m-partite graphs