Chromatic classes of 2-connected (n,n+3)-graphs with at least two triangles

DOI10.1016/0012-365X(92)00482-7zbMATH Open0796.05033OpenAlexW2109607656MaRDI QIDQ1322232FDOQ1322232

K. L. Teo, K. M. Koh

Publication date: 5 May 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)00482-7

Recommendations

• 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
• Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles.
• scientific article
• The chromaticity of a family of 2-connected 3-chromatic graphs with five triangles and cyclomatic number six

zbMATH Keywords

chromatically equivalentchromatic polynomialschromatically unique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites Work

• An introduction to chromatic polynomials
• Title not available (Why is that?)
• On chromatic coefficients
• Chromatic uniqueness of the generalized \(\Theta\)-graph
• Cutpoints and the chromatic polynomial
• Title not available (Why is that?)
• Title not available (Why is that?)
• Chromatically unique graphs
• Chromatic uniqueness and equivalence ofK4 homeomorphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two classes of chromatically unique graphs

Cited In (9)

• Title not available (Why is that?)
• Chromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles
• Chromatic classes of a class of \(2\)-connected \((n,n+2)\) graphs
• A bibliography on chromatic polynomials
• Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle
• Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles.
• The search for chromatically unique graphs
• On chromatic equivalence of graphs
• The search for chromatically unique graphs. II

This page was built for publication: Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322232)