List coloring the square of sparse graphs with large degree (Q740267): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2046676533
@@ Property / OpenAlex ID: W2046676533 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4197
@@ Property / arXiv ID: 1308.4197 / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. II: Reducibility
+Normal rank
@@ Property / cites work @@
+-Distance Coloring of Sparse Graphs
@@ Property / cites work: 2-Distance Coloring of Sparse Graphs / 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 @@
+Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
+Normal rank
@@ Property / cites work @@
+-distance coloring of sparse planar graphs
@@ Property / cites work: 2-distance coloring of sparse planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+List edge and list total colourings of multigraphs
+Normal rank
@@ Property / cites work @@
+Coloring squares of planar graphs with girth six
@@ Property / cites work: Coloring squares of planar graphs with girth six / rank @@
+Normal rank
@@ Property / cites work @@
+Labeling Planar Graphs with Conditions on Girth and Distance Two
+Normal rank
@@ Property / cites work @@
+The average degree of a multigraph critical with respect to edge or total choosability
+Normal rank