Choosability of toroidal graphs without short cycles (Q3055923): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q977288
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Wei Fan Wang / 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.1002/jgt.20460 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4230541033 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some counterexamples associated with the three-color problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic numbers of quadrangulations on closed surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Map-Colour Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Graphs without 7-Cycles Are 4-Choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without cycles of specific lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-coloring graphs embedded on surfaces with all faces even-sided / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 4-Color Theorem for Toroidal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The colour theorems of Brooks and Gallai extended / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 4-choosability of plane graphs without 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On structure of some plane graphs with application to choosability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph is 5-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Five-coloring graphs on the torus / 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: List colourings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A not 3-choosable planar graph without 3-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosability and edge choosability of planar graphs without five cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles / rank
 
Normal rank

Latest revision as of 11:38, 3 July 2024

scientific article
Language Label Description Also known as
English
Choosability of toroidal graphs without short cycles
scientific article

    Statements

    Choosability of toroidal graphs without short cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 November 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    choosability
    0 references
    list coloring
    0 references
    toroidal graph
    0 references
    cycle
    0 references
    discharging method
    0 references
    0 references