Spanning trees and spanning closed walks with small degrees (Q2144593): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2022.112998
@@ Property / DOI: 10.1016/j.disc.2022.112998 / rank @@
-Normal rank
@@ Property / cites work @@
+On factors with all degrees odd
@@ Property / cites work: On factors with all degrees odd / rank @@
+Normal rank
@@ Property / cites work @@
+Connected (g, f)-factors
@@ Property / cites work: Connected (g, f)-factors / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness, trees, and walks
@@ Property / cites work: Toughness, trees, and walks / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and the existence ofk-factors
@@ Property / cites work: Toughness and the existence ofk-factors / rank @@
+Normal rank
@@ Property / cites work @@
+Q4170745
@@ Property / cites work: Q4170745 / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning trees and spanning Eulerian subgraphs with small degrees
+Normal rank
@@ Property / cites work @@
+Q4014627
@@ Property / cites work: Q4014627 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4818793
@@ Property / cites work: Q4818793 / rank @@
+Normal rank
@@ Property / cites work @@
+Elementary graphs with respect to \(f\)-parity factors
+Normal rank
@@ Property / cites work @@
+On 2-connected spanning subgraphs with bounded degree in \(K _{1,r }\)-free graphs
+Normal rank
@@ Property / cites work @@
+On low bound of degree sequences of spanning trees inK-edge-connected graphs
+Normal rank
@@ Property / cites work @@
+Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
+Normal rank
@@ Property / cites work @@
+Spanning trees: A survey
@@ Property / cites work: Spanning trees: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+A note on matchings and spanning trees with bounded degrees
+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 @@
+Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor
+Normal rank
@@ Property / cites work @@
+Some results on odd factors of graphs
@@ Property / cites work: Some results on odd factors of graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2022.112998
@@ Property / DOI: 10.1016/J.DISC.2022.112998 / rank @@
+Normal rank