A special k-coloring for a connected k-chromatic graph

DOI10.1016/S0012-365X(96)00123-9zbMATH Open0879.05025MaRDI QIDQ1363668FDOQ1363668

Authors: Guantao Chen, W. E. Shreve, R. H. Schelp 

Publication date: 10 August 1997

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

Recommendations

• scientific article
• The connectivity of \(k\)-chromatic graphs
• Note on $k$-chromatic graphs
• ON DISTANCES IN CHROMATIC GRAPHS
• Connectedness of the graph of vertex-colourings

zbMATH Keywords

chromatic numberconnected graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Graph theory
• Title not available (Why is that?)

Cited In (2)

• Multiple vertex coverings by cliques
• The distance coloring of graphs

This page was built for publication: A special \(k\)-coloring for a connected \(k\)-chromatic graph

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