Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs (Q2698134): Difference between revisions

@@ Property / cites work @@
+Independence trees and Hamilton cycles
@@ Property / cites work: Independence trees and Hamilton cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
+Normal rank
@@ Property / cites work @@
+A note on Hamiltonian circuits
@@ Property / cites work: A note on Hamiltonian circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning 5-ended trees in \(K_{1,5}\)-free graphs
@@ Property / cites work: Spanning 5-ended trees in \(K_{1,5}\)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4897473
@@ Property / cites work: Q4897473 / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Hamilton connected graphs
@@ Property / cites work: Hamilton connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning trees: A survey
@@ Property / cites work: Spanning trees: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+On a conjecture of Las Vergnas concerning certain spanning trees in graphs
+Normal rank