Note on k-chromatic graphs

DOI10.21136/MB.1994.126206MaRDI QIDQ4301672zbMATH OpenOpenAlexFDO

Authors Dǎnuţ Marcu

Publication date 14 August 1994

Full work available at URL https://eudml.org/doc/29360

zbMATH Keywords

chromatic numberconnected graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Size, chromatic number, and connectivity
• Note on graphs colouring
• The connectivity of k-chromatic graphs
• Chromatic number and Hamiltonicity of graphs

Cited in

(8)

• Size, chromatic number, and connectivity
• A special \(k\)-coloring for a connected \(k\)-chromatic graph
• A note on \(b\)-coloring of Kneser graphs
• The connectivity of k-chromatic graphs
• Note on graphs colouring
• Adding edges to increase the chromatic number of a graph
• scientific article; zbMATH DE number 3251276 (Why is no real title available?)
• scientific article; zbMATH DE number 6604949 (Why is no real title available?)

This page was built for publication: Note on $k$-chromatic graphs

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