Unsolved graph colouring problems
From MaRDI portal
Publication:2822602
Recommendations
Cited in
(17)- Tight bounds on the clique chromatic number
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 4134067 (Why is no real title available?)
- Equivalent versions of group-connectivity theorems and conjectures
- Densities, matchings, and fractional edge-colorings
- Frozen development in graph coloring
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Monochromatic subgraphs in randomly colored graphons
- A brief history of edge-colorings -- with personal reminiscences
- Chromatic Zagreb and irregularity polynomials of graphs
- Modified chromatic Schultz polynomial of some cycle related graphs
- Open neighbourhood colouring of some path related graphs
- Polynomials counting nowhere-zero chains in graphs
- Vertex colouring and forbidden subgraphs -- a survey
- The Second-Moment Phenomenon for Monochromatic Subgraphs
- Some undecidable problems involving the edge-coloring and vertex-coloring of graphs
- Limit theorems for monochromatic stars
This page was built for publication: Unsolved graph colouring problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2822602)