Some structural properties of planar graphs and their applications to 3-choosability (Q658061): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Andre Raspaud / rank
Normal rank
 
Property / author
 
Property / author: Andre Raspaud / 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.disc.2011.09.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971430898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without cycles of length from 4 to 7 are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on 3-choosability of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for a planar graph to be 3-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: List colourings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-3-choosable planar graph without cycles of length 4 and 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on 3-choosability of planar graphs without certain cycles / rank
 
Normal rank

Latest revision as of 20:30, 4 July 2024

scientific article
Language Label Description Also known as
English
Some structural properties of planar graphs and their applications to 3-choosability
scientific article

    Statements

    Some structural properties of planar graphs and their applications to 3-choosability (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references