Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms (Q5458557): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1517042931
@@ Property / OpenAlex ID: W1517042931 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2760
@@ Property / arXiv ID: 0707.2760 / rank @@
+Normal rank
@@ Property / cites work @@
+On Linear Time Minor Tests with Depth-First Search
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2003
@@ Property / cites work: Mathematical Foundations of Computer Science 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning trees with many leaves in cubic graphs
@@ Property / cites work: Spanning trees with many leaves in cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning Trees with Many Leaves
@@ Property / cites work: Spanning Trees with Many Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252040
@@ Property / cites work: Q4252040 / rank @@
+Normal rank