A Brooks-type result for sparse critical graphs (Q1786052): Difference between revisions

From MaRDI portal
Merged Item from Q4928488
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Colorings of plane graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar 4-critical graphs with four triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defective 2-colorings of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs of coloring theorems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 1-improper 2-coloring of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the colouring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of k-chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Map Colour Theorems Related To the Heawood Colour Formula / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the edge-density of 4-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound on the number of edges in colour-critical graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore's conjecture on color-critical graphs is almost true / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore's conjecture for \(k=4\) and Grötzsch's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimal number of edges in color-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colour-critical graphs and hypergraphs / rank
 
Normal rank

Latest revision as of 16:36, 16 July 2024

scientific article; zbMATH DE number 6176256
  • On Coloring of Sparse Graphs
Language Label Description Also known as
English
A Brooks-type result for sparse critical graphs
scientific article; zbMATH DE number 6176256
  • On Coloring of Sparse Graphs

Statements

A Brooks-type result for sparse critical graphs (English)
0 references
On Coloring of Sparse Graphs (English)
0 references
24 September 2018
0 references
14 June 2013
0 references
sparse critical graphs
0 references
graph coloring
0 references
\(k\)-critical graphs
0 references
improper coloring
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references