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

DOI10.1016/0012-365X(92)00482-7MaRDI QIDQ1322232zbMATH OpenOpenAlexFDO

Authors K. M. Koh, K. L. Teo

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

zbMATH Keywords

chromatically equivalentchromatic polynomialschromatically unique

Mathematics Subject Classification ID

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

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; zbMATH DE number 54779
• The chromaticity of a family of 2-connected 3-chromatic graphs with five triangles and cyclomatic number six

Cites work

• scientific article; zbMATH DE number 3843776 (Why is no real title available?)
• scientific article; zbMATH DE number 4049668 (Why is no real title available?)
• scientific article; zbMATH DE number 54779 (Why is no real title available?)
• scientific article; zbMATH DE number 3556126 (Why is no real title available?)
• scientific article; zbMATH DE number 3050594 (Why is no real title available?)
• An introduction to chromatic polynomials
• Chromatic uniqueness and equivalence ofK4 homeomorphs
• Chromatic uniqueness of the generalized -graph
• Chromatically unique graphs
• Cutpoints and the chromatic polynomial
• On chromatic coefficients
• Two classes of chromatically unique graphs

Cited in

(11)

• scientific article; zbMATH DE number 54779 (Why is no real title available?)
• Chromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles
• Pairs of chromatically equivalent graphs
• A bibliography on chromatic polynomials
• Chromatic classes of a class of \(2\)-connected \((n,n+2)\) graphs
• 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
• The chromatic equivalence class of \(K_{1, n, n + 2}\)
• 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)