The chromaticity of a family of 2-connected 3-chromatic graphs with five triangles and cyclomatic number six

DOI10.7151/DMGT.1067zbMATH Open0910.05024OpenAlexW2091679656MaRDI QIDQ4222385FDOQ4222385

Authors: Halina Bielak 

Publication date: 9 April 1999

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/dd4ae5e6cd178b94acbb182e1749c04c2dd03dcd

Recommendations

• Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles
• 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 Keywords

chromatic numbercyclomatic numberchromaticitychromatic equivalence

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (1)

• Chromatic classes of 2-connected \((n, n + 4)\)-graphs with exactly three triangles and at least two induced 4-cycles

This page was built for publication: The chromaticity of a family of 2-connected 3-chromatic graphs with five triangles and cyclomatic number six

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