Colouring graphs with bounded generalized colouring number (Q1045038): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2008.03.024
@@ Property / DOI: 10.1016/j.disc.2008.03.024 / rank @@
-Normal rank
@@ Property / cites work @@
+Graphs with linearly bounded Ramsey numbers
@@ Property / cites work: Graphs with linearly bounded Ramsey numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Excluding any graph as a minor allows a low tree-width 2-coloring
+Normal rank
@@ Property / cites work @@
+A simple competitive graph coloring algorithm
@@ Property / cites work: A simple competitive graph coloring algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Radius two trees specify χ‐bounded classes
@@ Property / cites work: Radius two trees specify χ‐bounded classes / rank @@
+Normal rank
@@ Property / cites work @@
+Orderings on graphs and game coloring number
@@ Property / cites work: Orderings on graphs and game coloring number / rank @@
+Normal rank
@@ Property / cites work @@
+Q3333070
@@ Property / cites work: Q3333070 / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-depth, subgraph coloring and homomorphism bounds
+Normal rank
@@ Property / cites work @@
+Linear time low tree-width partitions and algorithmic consequences
+Normal rank
@@ Property / cites work @@
+An extremal function for contractions of graphs
@@ Property / cites work: An extremal function for contractions of graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2008.03.024
@@ Property / DOI: 10.1016/J.DISC.2008.03.024 / rank @@
+Normal rank