Minimum degree, leaf number and traceability (Q2864428): Difference between revisions

@@ Property / describes a project that uses @@
+Graffiti.pc
@@ Property / describes a project that uses: Graffiti.pc / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1978986700
@@ Property / OpenAlex ID: W1978986700 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on degree conditions for traceability in locally claw-free graphs
+Normal rank
@@ Property / cites work @@
+Spanning trees with many leaves and average distance
+Normal rank
@@ Property / cites work @@
+Spanning trees with many leaves
@@ Property / cites work: Spanning trees with many leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal spanning trees with a constraint on the number of leaves
+Normal rank
@@ Property / cites work @@
+Sufficient conditions for a graph to be Hamiltonian
+Normal rank
@@ Property / cites work @@
+Forbidden subgraphs and Hamiltonian properties and graphs
+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 @@
+Spanning Trees with Many Leaves
@@ Property / cites work: Spanning Trees with Many Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian cycles in 2‐connected claw‐free‐graphs
+Normal rank
@@ Property / cites work @@
+A sufficient condition for graphs with large neighborhood unions to be traceable
+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