Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155): 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: Ying Qian Wang / rank
Normal rank
 
Property / author
 
Property / author: Hua Jing Lu / rank
Normal rank
 
Property / author
 
Property / author: Ying Qian Wang / rank
 
Normal rank
Property / author
 
Property / author: Hua Jing Lu / 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.2009.08.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043040176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and orientations of graphs / 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: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of planar graph choosability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-choosability of plane graphs of girth 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bordeaux 3-color conjecture and 3-choosability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the not 3-choosability of some families of planar graphs / 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: Every planar graph is 5-choosable / 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: 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: On 3-colorable planar graphs without prescribed cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable / 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: A note on 3-choosability of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-colorable plane graphs without 5- and 7-cycles / 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 07:56, 2 July 2024

scientific article
Language Label Description Also known as
English
Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
scientific article

    Statements

    Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (English)
    0 references
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    planar graph
    0 references
    cycle
    0 references
    choosability
    0 references
    colorability
    0 references
    0 references