The smallest pair of cospectral cubic graphs with different chromatic indexes
From MaRDI portal
Publication:2065795
DOI10.1016/j.dam.2021.12.016zbMath1481.05057arXiv2112.06112OpenAlexW4212944934MaRDI QIDQ2065795
Publication date: 13 January 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.06112
Uses Software
Cites Work
- Unnamed Item
- Cospectral graphs and regular orthogonal matrices of level 2
- Cospectral regular graphs with and without a perfect matching
- A note on non-\(\mathbb{R}\)-cospectral graphs
- Constructing cospectral graphs
- The Petersen graph is not 3-edge-colorable---a new proof
- Cospectral graphs, GM-switching and regular rational orthogonal matrices of level \(p\)
- The Petersen graph is not 1-factorable: postscript to `The Petersen graph is not 3-edge-colorable -- a new proof' [Discrete Math. 268 (2003) 325--326]
- Distance-regularity and the spectrum of graphs
- On a theorem of Godsil and McKay concerning the construction of cospectral graphs
- On NP-hard graph properties characterized by the spectrum
- Cospectral pairs of regular graphs with different connectivity
- Generalized cospectral graphs with and without Hamiltonian cycles
- Practical graph isomorphism. II.
- The chromatic index of strongly regular graphs
- The NP-Completeness of Edge-Coloring
- Graphs cospectral with distance-regular graphs
This page was built for publication: The smallest pair of cospectral cubic graphs with different chromatic indexes
