Structures and chromaticity of some extremal 3-colourable graphs

DOI10.1016/S0012-365X(99)00014-XzbMATH Open0932.05034OpenAlexW1977395585MaRDI QIDQ1301656FDOQ1301656

F. M. Dong, K. M. Koh

Publication date: 13 March 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00014-x

Recommendations

• Structures and chromaticity of extremal 3-colourable sparse graphs
• Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles
• scientific article
• On uniquely \(3\)-colorable graphs. II

zbMATH Keywords

chromatic polynomialchromaticity3-colourable

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• The search for chromatically unique graphs
• The search for chromatically unique graphs. II
• On graphs in which any pair of colour classes but one induces a tree
• On the structure and chromaticity of graphs in which any two colour classes induce a tree

Cited In (13)

• 3-colouring for dually chordal graphs and generalisations
• Homomorphisms of 3-chromatic graphs
• Extremizing first eigenvalue of 3-colored digraphs made with given blocks
• Extremal properties of the chromatic polynomials of connected 3-chromatic graphs
• Title not available (Why is that?)
• On the maximal triangle-free edge-chromatic graphs in three colors
• Strict colourings of STS(\(3v\))s and uncolourable BSTS(\(3v\))s
• Absolutely 3-chromatic graphs
• Title not available (Why is that?)
• The Typical Structure of Gallai Colorings and Their Extremal Graphs
• A note on graph colouring
• Title not available (Why is that?)
• Structures and chromaticity of extremal 3-colourable sparse graphs

This page was built for publication: Structures and chromaticity of some extremal 3-colourable graphs

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