Entire coloring of 2-connected plane graphs (Q2662784): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2020.103286 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Every planar map is four colorable / 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: A seven-color theorem on the sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Sechsfarbenproblem auf der Kugel / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Entire Coloring Conjecture / 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: Entire colouring of plane graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJC.2020.103286 / rank
 
Normal rank

Latest revision as of 14:08, 19 December 2024

scientific article
Language Label Description Also known as
English
Entire coloring of 2-connected plane graphs
scientific article

    Statements

    Identifiers