The entire chromatic number of graphs embedded on the torus with large maximum degree (Q2402264): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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 seven-color theorem on the sphere / 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 the Entire Coloring Conjecture / 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: Plane Graphs with Maximum Degree Are Entirely ‐Colorable / rank
 
Normal rank

Revision as of 08:28, 14 July 2024

scientific article
Language Label Description Also known as
English
The entire chromatic number of graphs embedded on the torus with large maximum degree
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references