A critically chromatic graph

DOI10.1016/S0012-365X(96)00262-2zbMATH Open0883.05047OpenAlexW2055899843MaRDI QIDQ1366769FDOQ1366769

Authors: Chong-Yun Chao 

Publication date: 22 January 1998

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00262-2

Recommendations

• On a question of Dirac on critical and vertex critical graphs
• Colour-critical graphs with few edges
• scientific article; zbMATH DE number 4154465
• Dense critical and vertex-critical graphs

zbMATH Keywords

Cayley graphconnectivitycritical graphchrmatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• On the Classification of Symmetric Graphs with a Prime Number of Vertices
• On uniquely 3-colorable graphs
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen

Cited In (9)

• On \(4\)-colorable robust critical graphs
• Dense critical and vertex-critical graphs
• Edge 4-critical Koester graph of order 28
• Finding the chromatic number by means of critical graphs
• On uniquely \(3\)-colorable graphs. II
• An analogue of Dirac's theorem on circular super-critical graphs
• Critically cochromatic graphs
• Title not available (Why is that?)
• A Möbius-type gluing technique for obtaining edge-critical graphs

This page was built for publication: A critically chromatic graph

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