Plane Graphs with Maximum Degree Are Entirely ‐Colorable (Q5325942): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ying Qian Wang / rank
Normal rank
 
Property / author
 
Property / author: Zheng-Ke Miao / rank
Normal rank
 
Property / author
 
Property / author: Ying Qian Wang / rank
 
Normal rank
Property / author
 
Property / author: Zheng-Ke Miao / 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.21676 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1507616401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total coloring of planar graphs. / 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: 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: Entire colouring of plane graphs / rank
 
Normal rank

Latest revision as of 16:23, 6 July 2024

scientific article; zbMATH DE number 6193104
Language Label Description Also known as
English
Plane Graphs with Maximum Degree Are Entirely ‐Colorable
scientific article; zbMATH DE number 6193104

    Statements

    Identifiers