Sparse Graphs Are Near-Bipartite (Q5130577): Difference between revisions

@@ Property / author @@
-Matthew P. Yancey
@@ Property / author: Matthew P. Yancey / rank @@
-Normal rank
@@ Property / author @@
+Matthew P. Yancey
@@ Property / author: Matthew P. Yancey / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.12570
@@ Property / arXiv ID: 1903.12570 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex Contact Representations of Paths on a Grid
@@ Property / cites work: Vertex Contact Representations of Paths on a Grid / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Dense Subgraphs with Size Bounds
@@ Property / cites work: Finding Dense Subgraphs with Size Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Vertex Partitions
@@ Property / cites work: Optimal Vertex Partitions / rank @@
+Normal rank
@@ Property / cites work @@
+Independent feedback vertex sets for graphs of bounded diameter
+Normal rank
@@ Property / cites work @@
+Recognizing Graphs Close to Bipartite Graphs
@@ Property / cites work: Recognizing Graphs Close to Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3859822
@@ Property / cites work: Q3859822 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4797463
@@ Property / cites work: Q4797463 / rank @@
+Normal rank
@@ Property / cites work @@
+Variable degeneracy: Extensions of Brooks' and Gallai's theorems
+Normal rank
@@ Property / cites work @@
+Cycle transversals in perfect graphs and cographs
@@ Property / cites work: Cycle transversals in perfect graphs and cographs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of some problems related to GRAPH 3-COLORABILITY
+Normal rank
@@ Property / cites work @@
+Vertex arboricity and maximum degree
@@ Property / cites work: Vertex arboricity and maximum degree / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset
+Normal rank
@@ Property / cites work @@
+Partitioning a triangle-free planar graph into a forest and a forest of bounded degree
+Normal rank
@@ Property / cites work @@
+Decomposing a planar graph of girth 5 into an independent set and a forest
+Normal rank
@@ Property / cites work @@
+Ore's conjecture on color-critical graphs is almost true
+Normal rank
@@ Property / cites work @@
+A Brooks-type result for sparse critical graphs
@@ Property / cites work: A Brooks-type result for sparse critical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Pebble game algorithms and sparse graphs
@@ Property / cites work: Pebble game algorithms and sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse hypergraphs and pebble game algorithms
@@ Property / cites work: Sparse hypergraphs and pebble game algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Partition the vertices of a graph into one independent set and one acyclic set
+Normal rank
@@ Property / cites work @@
+Constructing a Family of 4‐Critical Planar Graphs with High Edge Density
+Normal rank
@@ Property / cites work @@
+A note on orientation and chromatic number of graphs
+Normal rank
@@ Property / OpenAlex ID @@
+W3048715473
@@ Property / OpenAlex ID: W3048715473 / rank @@
+Normal rank