Unsolved graph colouring problems

zbMATH Open1377.05064MaRDI QIDQ2822602FDOQ2822602

Authors: T. R. Jensen, Bjarne Toft 

Publication date: 30 September 2016

Recommendations

• scientific article; zbMATH DE number 4134067
• Two Chromatic Conjectures: One for Vertices and One for Edges
• scientific article; zbMATH DE number 821271
• scientific article; zbMATH DE number 1156585
• Hadwiger's conjecture

zbMATH Keywords

graphs on surfacesflows on graphsgraph colouring problemsprobability colouring

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Flows in graphs (05C21)

Cited In (17)

• Tight bounds on the clique chromatic number
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• The Second-Moment Phenomenon for Monochromatic Subgraphs
• Vertex colouring and forbidden subgraphs -- a survey
• 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)