Upper bounds on the linear chromatic number of a graph (Q626759): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2010.10.023
+Normal rank
@@ Property / OpenAlex ID @@
+W2041763089
@@ Property / OpenAlex ID: W2041763089 / rank @@
+Normal rank
@@ Property / cites work @@
+Structural theorem on plane graphs with application to the entire coloring number
+Normal rank
@@ Property / cites work @@
+Linear choosability of graphs
@@ Property / cites work: Linear choosability of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring a graph frugally
@@ Property / cites work: Colouring a graph frugally / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring the square of a planar graph
@@ Property / cites work: Coloring the square of a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Linear coloring of graphs embeddable in a surface of nonnegative characteristic
+Normal rank
@@ Property / cites work @@
+Linear coloring of graphs
@@ Property / cites work: Linear coloring of graphs / rank @@
+Normal rank