Decomposing a planar graph with girth at least 8 into a forest and a matching (Q534048): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2011.01.019
@@ Property / DOI: 10.1016/j.disc.2011.01.019 / rank @@
-Normal rank
@@ Property / author @@
-Ying Qian Wang
@@ Property / author: Ying Qian Wang / rank @@
-Normal rank
@@ Property / author @@
+Ying Qian Wang
@@ Property / author: Ying Qian Wang / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q60060265
@@ Property / Wikidata QID: Q60060265 / 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.disc.2011.01.019
+Normal rank
@@ Property / OpenAlex ID @@
+W2070483072
@@ Property / OpenAlex ID: W2070483072 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing a planar graph with girth 9 into a forest and a matching
+Normal rank
@@ Property / cites work @@
+Edge-partitions of planar graphs and their game coloring numbers
+Normal rank
@@ Property / cites work @@
+Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2011.01.019
@@ Property / DOI: 10.1016/J.DISC.2011.01.019 / rank @@
+Normal rank