A note on graph colouring
From MaRDI portal
Publication:4854635
DOI10.21136/CMJ.1995.128528zbMATH Open0837.05058OpenAlexW2728604704MaRDI QIDQ4854635FDOQ4854635
Publication date: 13 May 1996
Full work available at URL: https://eudml.org/doc/31475
Recommendations
Cites Work
Cited In (12)
- 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
- 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)