Chromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles
From MaRDI portal
Publication:410649
DOI10.5402/2011/430396zbMath1238.05139OpenAlexW1539886823WikidataQ58689414 ScholiaQ58689414MaRDI QIDQ410649
Publication date: 3 April 2012
Published in: ISRN Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5402/2011/430396
Cites Work
- Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle
- Chromatic uniqueness of the generalized \(\Theta\)-graph
- Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles
- The coloring of graphs
- 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
This page was built for publication: Chromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles
