Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle
From MaRDI portal
Publication:1025926
DOI10.1016/J.DISC.2008.08.016zbMath1231.05100OpenAlexW2050825359MaRDI QIDQ1025926
Publication date: 23 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.08.016
Related Items (1)
Cites Work
- Chromatic uniqueness of the generalized \(\Theta\)-graph
- Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles
- Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles.
- Cutpoints and the chromatic polynomial
- On chromatic equivalence of graphs
- A note on the chromaticity of some 2-connected \((n,n+3)\)-graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle