A critically chromatic graph

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

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

zbMATH Keywords

Cayley graphconnectivitycritical graphchrmatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

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

Related Items (3)

Finding the chromatic number by means of critical graphs ⋮ Critically cochromatic graphs ⋮ On uniquely \(3\)-colorable graphs. II

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)