Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions (Q2800597): Difference between revisions

@@ Property / cites work @@
+Q3115724
@@ Property / cites work: Q3115724 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
+Normal rank
@@ Property / cites work @@
+Defective 2-colorings of sparse graphs
@@ Property / cites work: Defective 2-colorings of sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On 1-improper 2-coloring of sparse graphs
@@ Property / cites work: On 1-improper 2-coloring of sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Limits of Near-Coloring of Sparse Graphs
@@ Property / cites work: Limits of Near-Coloring of Sparse Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On chromatic number of graphs and set-systems
@@ Property / cites work: On chromatic number of graphs and set-systems / rank @@
+Normal rank
@@ Property / cites work @@
+A Complexity Dichotomy for the Coloring of Sparse Graphs
+Normal rank
@@ Property / cites work @@
+Path partitions of planar graphs
@@ Property / cites work: Path partitions of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improper choosability of graphs and maximum average degree
+Normal rank
@@ Property / cites work @@
+Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Globally sparse vertex‐ramsey graphs
@@ Property / cites work: Globally sparse vertex‐ramsey graphs / rank @@
+Normal rank