Spanning trees with many leaves: lower bounds in terms of the number of vertices of degree 1, 3 and at least 4 (Q744554): Difference between revisions

@@ Property / cites work @@
+Constructing full spanning trees for cubic graphs
@@ Property / cites work: Constructing full spanning trees for 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 @@
+Spanning trees in graphs of minimum degree 4 or 5
@@ Property / cites work: Spanning trees in graphs of minimum degree 4 or 5 / rank @@
+Normal rank
@@ Property / cites work @@
+Transversal numbers of uniform hypergraphs
@@ Property / cites work: Transversal numbers of uniform hypergraphs / 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 @@
+Connected Domination and Spanning Trees with Many Leaves
+Normal rank
@@ Property / cites work @@
+Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
+Normal rank
@@ Property / cites work @@
+Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
+Normal rank
@@ Property / cites work @@
+Bounds of the number of leaves of spanning trees
@@ Property / cites work: Bounds of the number of leaves of spanning trees / rank @@
+Normal rank