Note on graphs colouring

DOI10.21136/MB.1992.125898MaRDI QIDQ4016725zbMATH OpenOpenAlexFDO

Authors Dǎnuţ Marcu

Publication date 16 January 1993

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

zbMATH Keywords

chromatic numbercliqueisolated vertices

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• A note on graph colouring
• Note on k-chromatic graphs
• Graphs with chromatic numbers strictly less than their colouring numbers
• On the maximum number of colorings of a graph
• scientific article; zbMATH DE number 3882454

Cited in

(12)

• Graph colouring and variations
• Colouring the petals of a graph
• Graphs with chromatic numbers strictly less than their colouring numbers
• scientific article; zbMATH DE number 411546 (Why is no real title available?)
• scientific article; zbMATH DE number 3966126 (Why is no real title available?)
• Note on k-chromatic graphs
• Graph colorings
• Multiple vertex coverings by cliques
• A note on graph colouring
• Maximal colourings for graphs
• Coloring a graph optimally with two colors
• A note on chromatic blending of colour clusters

This page was built for publication: Note on graphs colouring

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