Plane graphs with maximum degree 9 are entirely 11-choosable (Q2629286): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
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 / author
 
Property / author: Yi Qiao 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.1016/j.disc.2016.05.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2417377661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3784093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural theorem on plane graphs with application to the entire coloring number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on entire choosability of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entire choosability of near-outerplane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: PLANE GRAPHS ARE ENTIRELY (Δ + 5)-CHOOSABLE / rank
 
Normal rank
Property / cites work
 
Property / cites work: The entire chromatic number of a normal graph is at most seven / rank
 
Normal rank
Property / cites work
 
Property / cites work: A seven-color theorem on the sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Entire Coloring Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the colorings of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds of entire chromatic number of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Graphs with $\Delta\ge 9$ are Entirely $(\Delta+2)$-Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane Graphs with Maximum Degree Are Entirely ‐Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The entire choosability of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entire colouring of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complete chromatic number of some planar graphs / rank
 
Normal rank

Latest revision as of 07:12, 12 July 2024

scientific article
Language Label Description Also known as
English
Plane graphs with maximum degree 9 are entirely 11-choosable
scientific article

    Statements

    Plane graphs with maximum degree 9 are entirely 11-choosable (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 July 2016
    0 references
    plane graph
    0 references
    entire choosability
    0 references
    maximum degree
    0 references

    Identifiers