Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles.
From MaRDI portal
Publication:1427480
DOI10.1016/j.disc.2003.05.003zbMath1033.05045OpenAlexW2983506641MaRDI QIDQ1427480
Publication date: 14 March 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2003.05.003
Related Items (2)
Chromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles ⋮ Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle
Cites Work
- Unnamed Item
- Unnamed Item
- Two classes of chromatically unique graphs
- On chromatic coefficients
- The chromatic uniqueness of certain broken wheels
- Chromatic uniqueness of the generalized \(\Theta\)-graph
- Chromatically unique graphs
- Chromatic polynomials of homeomorphism classes of graphs
- Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles
- Cutpoints and the chromatic polynomial
- On chromatic equivalence of graphs
- An introduction to chromatic polynomials
- A note on the chromaticity of some 2-connected \((n,n+3)\)-graphs
This page was built for publication: Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles.