Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs (Q2851443): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2009.07.014 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / 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: A short list color proof of Grötzsch's theorem / 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: Many 3-colorings of triangle-free planar graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2009.07.014 / rank
 
Normal rank

Latest revision as of 01:05, 20 December 2024

scientific article
Language Label Description Also known as
English
Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs
scientific article

    Statements

    Identifiers

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