Degree bounded spanning trees (Q605003): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00373-010-0941-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2044691815
@@ Property / OpenAlex ID: W2044691815 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3921262
@@ Property / cites work: Q3921262 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+On the largest tree of given maximum degree in a connected graph
+Normal rank
@@ Property / cites work @@
+A note on Hamiltonian circuits
@@ Property / cites work: A note on Hamiltonian circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness, trees, and walks
@@ Property / cites work: Toughness, trees, and walks / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for a graph to have a \(k\)-tree
+Normal rank
@@ Property / cites work @@
+Spanning trees with bounded degrees
@@ Property / cites work: Spanning trees with bounded degrees / rank @@
+Normal rank
@@ Property / cites work @@
+Note on Hamilton Circuits
@@ Property / cites work: Note on Hamilton Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Q3139712
@@ Property / cites work: Q3139712 / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning trees with few leaves
@@ Property / cites work: Spanning trees with few leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
+Normal rank
@@ Property / cites work @@
+On a connection between the existence of k-trees and the toughness of a graph
+Normal rank
@@ Property / cites work @@
+On degree sum conditions for long cycles and cycles through specified vertices
+Normal rank