Chromatic classes of 2-connected (n,n+4)-graphs with three triangles and one induced 4-cycle

DOI10.1016/J.DISC.2008.08.016MaRDI QIDQ1025926zbMATH OpenOpenAlexFDO

Authors G. C. Lau, Y. H. Peng

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

zbMATH Keywords

chromatic polynomialchromatically equivalent graphchromatically unique graphrelative-closed

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph polynomials (05C31)

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 at least four triangles.
• Chromatic classes of 2-connected (n,n+3)-graphs with at least two triangles
• scientific article; zbMATH DE number 54779
• The chromaticity of certain cycles with edges

Cites work

• A note on the chromaticity of some 2-connected (n,n+3)-graphs
• 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.
• Chromatic uniqueness of the generalized -graph
• Cutpoints and the chromatic polynomial
• scientific article; zbMATH DE number 54779 (Why is no real title available?)
• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• scientific article; zbMATH DE number 3050594 (Why is no real title available?)
• On chromatic equivalence of graphs

Cited in

(8)

• 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.
• Chromatic classes of a class of 2-connected (n,n+2) graphs
• 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
• On chromatic equivalence of graphs
• The chromaticity of a family of 2-connected 3-chromatic graphs with five triangles and cyclomatic number six
• Chromatic uniqueness of two kinds of 2-connected (n,n+4)-graphs

This page was built for publication: Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle

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