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

@@ Property / full work available at URL @@
+https://doi.org/10.1002/jgt.21676
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.21676 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1507616401
@@ Property / OpenAlex ID: W1507616401 / rank @@
+Normal rank
@@ Property / cites work @@
+On the total coloring of planar graphs.
@@ Property / cites work: On the total coloring of planar graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
+Normal rank
@@ Property / cites work @@
+Structural theorem on plane graphs with application to the entire coloring number
+Normal rank
@@ Property / cites work @@
+The entire chromatic number of a normal graph is at most seven
+Normal rank
@@ Property / cites work @@
+A seven-color theorem on the sphere
@@ Property / cites work: A seven-color theorem on the sphere / rank @@
+Normal rank
@@ Property / cites work @@
+On the Entire Coloring Conjecture
@@ Property / cites work: On the Entire Coloring Conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Entire colouring of plane graphs
@@ Property / cites work: Entire colouring of plane graphs / rank @@
+Normal rank