Entire coloring of graphs embedded in a surface of nonnegative characteristic (Q1756114): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Coloring vertices and faces of locally planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dirac's map-color theorem for choosability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the 6 color theorem / 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: Choosability of toroidal graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The entire chromatic number of graphs embedded on the torus with large maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of degree 4 are 5-edge-choosable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring even-faced graphs in the torus and the Klein bottle / 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: The 4-choosability of toroidal graphs without intersecting triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simultaneous colorings of embedded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simultaneous edge-face colorings of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Entire Coloring Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge-face coloring of graphs embedded in a surface of characteristic zero / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge-face choosability of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coupled 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: Planar Graphs with $\Delta\ge 9$ are Entirely $(\Delta+2)$-Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneously colouring the edges and faces of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colourings of graphs / rank
 
Normal rank

Latest revision as of 20:06, 17 July 2024

scientific article
Language Label Description Also known as
English
Entire coloring of graphs embedded in a surface of nonnegative characteristic
scientific article

    Statements

    Entire coloring of graphs embedded in a surface of nonnegative characteristic (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 January 2019
    0 references
    embedded graph
    0 references
    Euler characteristic
    0 references
    entire coloring
    0 references
    maximum degree
    0 references
    0 references
    0 references

    Identifiers