A note on graph colouring

DOI10.21136/CMJ.1995.128528zbMATH Open0837.05058OpenAlexW2728604704MaRDI QIDQ4854635FDOQ4854635

Authors: Dǎnuţ Marcu 

Publication date: 13 May 1996

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

Recommendations

• Note on graphs colouring
• scientific article; zbMATH DE number 151823
• scientific article; zbMATH DE number 881297
• Structures and chromaticity of some extremal 3-colourable graphs
• scientific article; zbMATH DE number 4114659

zbMATH Keywords

chromatic numberconnected graphcyclegraph colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• An introduction to chromatic polynomials
• Title not available (Why is that?)
• Uniquely colorable graphs

Cited In (13)

• On graphs with restricted link graphs and the chromatic number at most $3$
• The chromatic number of a graph with two odd holes and an odd girth
• Note on graphs colouring
• An exact bound on the number of proper 3-edge-colorings of a connected cubic graph
• The interleaved multichromatic number of a graph
• Title not available (Why is that?)
• A note on the colour class of a self-complementary graph
• Title not available (Why is that?)
• A NOTE ON COLOURING OF COMPLETE GRAPHS
• A note on semi-coloring of graphs
• Structures and chromaticity of extremal 3-colourable sparse graphs
• Title not available (Why is that?)
• Revisiting a theorem by Folkman on graph colouring

This page was built for publication: A note on graph colouring

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