Many 3-colorings of triangle-free planar graphs (Q875936): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Carsten Thomassen / rank
Normal rank
 
Property / author
 
Property / author: Carsten Thomassen / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56926656 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jctb.2006.06.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988876227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs with fixed genus and girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-list-coloring planar graphs of girth 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-critical graphs on a fixed surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short list color proof of Grötzsch's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of a graph of girth 5 on a fixed surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of \(k\)-colorings of a graph on a fixed surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentially many 5-list-colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A not 3-choosable planar graph without 3-cycles / rank
 
Normal rank

Latest revision as of 17:25, 25 June 2024

scientific article
Language Label Description Also known as
English
Many 3-colorings of triangle-free planar graphs
scientific article

    Statements