Decomposing a graph into forests (Q765188): Difference between revisions

@@ Property / DOI @@
-.1016/j.jctb.2011.04.001
@@ Property / DOI: 10.1016/j.jctb.2011.04.001 / rank @@
-Normal rank
@@ Property / author @@
-Andre Raspaud
@@ Property / author: Andre Raspaud / rank @@
-Normal rank
@@ Property / author @@
+Andre Raspaud
@@ Property / author: Andre Raspaud / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q60060266
@@ Property / Wikidata QID: Q60060266 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jctb.2011.04.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2090015399
@@ Property / OpenAlex ID: W2090015399 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering planar graphs with forests
@@ Property / cites work: Covering planar graphs with forests / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE COMPLEXITY OF SOME COLORING GAMES
@@ Property / cites work: ON THE COMPLEXITY OF SOME COLORING GAMES / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing a planar graph into a forest and a subgraph of restricted maximum degree
+Normal rank
@@ Property / cites work @@
+Decomposing a planar graph with girth 9 into a forest and a matching
+Normal rank
@@ Property / cites work @@
+Fractional arboricity, strength, and principal partitions in graphs and matroids
+Normal rank
@@ Property / cites work @@
+Q4201568
@@ Property / cites work: Q4201568 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering planar graphs with forests, one having bounded maximum degree
+Normal rank
@@ Property / cites work @@
+On the degrees of the vertices of a directed graph
+Normal rank
@@ Property / cites work @@
+Edge-partitions of planar graphs and their game coloring numbers
+Normal rank
@@ Property / cites work @@
+Q4873220
@@ Property / cites work: Q4873220 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
+Normal rank
@@ Property / cites work @@
+Decomposition of sparse graphs, with application to game coloring number
+Normal rank
@@ Property / cites work @@
+Decomposition of Finite Graphs Into Forests
@@ Property / cites work: Decomposition of Finite Graphs Into Forests / rank @@
+Normal rank
@@ Property / cites work @@
+Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
+Normal rank
@@ Property / cites work @@
+Decomposing a planar graph with girth at least 8 into a forest and a matching
+Normal rank
@@ Property / cites work @@
+The game coloring number of planar graphs
@@ Property / cites work: The game coloring number of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Refined activation strategy for the marking game
@@ Property / cites work: Refined activation strategy for the marking game / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JCTB.2011.04.001
@@ Property / DOI: 10.1016/J.JCTB.2011.04.001 / rank @@
+Normal rank