Spanning paths in graphs (Q1727750): Difference between revisions

@@ Property / cites work @@
+Long cycles in graphs with prescribed toughness and minimum degree
+Normal rank
@@ Property / cites work @@
+A generalization of Ore's Theorem involving neighborhood unions
+Normal rank
@@ Property / cites work @@
+Q5477958
@@ Property / cites work: Q5477958 / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning trees with many leaves and average distance
+Normal rank
@@ Property / cites work @@
+Some Theorems on Abstract Graphs
@@ Property / cites work: Some Theorems on Abstract Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The longest cycles in a graph G with minimum degree at least \(| G| /k\)
+Normal rank
@@ Property / cites work @@
+Q4500709
@@ Property / cites work: Q4500709 / rank @@
+Normal rank
@@ Property / cites work @@
+New sufficient conditions for cycles in graphs
@@ Property / cites work: New sufficient conditions for cycles in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal problems involving neighborhood unions
@@ Property / cites work: Extremal problems involving neighborhood unions / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal spanning trees with a constraint on the number of leaves
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Sufficient conditions for a graph to be Hamiltonian
+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 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 @@
+Longest cycles in tough graphs
@@ Property / cites work: Longest cycles in tough 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 @@
+Lower bounds of length of longest cycles in graphs involving neighborhood unions
+Normal rank
@@ Property / cites work @@
+On minimum degree, leaf number, traceability and Hamiltonicity in graphs
+Normal rank
@@ Property / cites work @@
+Minimum Degree, Leaf Number, and Hamiltonicity
@@ Property / cites work: Minimum Degree, Leaf Number, and Hamiltonicity / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum degree, leaf number and traceability
@@ Property / cites work: Minimum degree, leaf number and traceability / rank @@
+Normal rank
@@ Property / cites work @@
+On spanning cycles, paths and trees
@@ Property / cites work: On spanning cycles, paths and trees / rank @@
+Normal rank
@@ Property / cites work @@
+DEGREE DISTANCE AND MINIMUM DEGREE
@@ Property / cites work: DEGREE DISTANCE AND MINIMUM DEGREE / rank @@
+Normal rank
@@ Property / cites work @@
+Q5628163
@@ Property / cites work: Q5628163 / rank @@
+Normal rank
@@ Property / cites work @@
+Note on Hamilton Circuits
@@ Property / cites work: Note on Hamilton Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Length of longest cycles in a graph whose relative length is at least two
+Normal rank
@@ Property / cites work @@
+A sufficient condition for graphs with large neighborhood unions to be traceable
+Normal rank
@@ Property / cites work @@
+Q5494200
@@ Property / cites work: Q5494200 / rank @@
+Normal rank
@@ 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 @@
+Traceability of line graphs
@@ Property / cites work: Traceability of line graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Circumference and girth
@@ Property / cites work: Circumference and girth / rank @@
+Normal rank