On problems and conjectures on adjointly equivalent graphs
From MaRDI portal
Publication:556853
DOI10.1016/J.DISC.2005.02.009zbMath1063.05054OpenAlexW2027736683WikidataQ123010501 ScholiaQ123010501MaRDI QIDQ556853
Xue Liang Li, Ru-Ying Liu, Hai-xing Zhao
Publication date: 23 June 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.02.009
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Cites Work
- A new method for proving chromatic uniqueness of graphs
- Adjoint polynomials and chromatically unique graphs
- On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs
- Chromaticity of some families of dense graphs
- Graphs with chromatic polynomial \(\sum_{l\leqslant m_0}\binom l{m_0-l} (\lambda)_l\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On problems and conjectures on adjointly equivalent graphs
