Leaf number and Hamiltonian \(C_4\)-free graphs (Q1693960): Difference between revisions

@@ Property / DOI @@
-.1007/s13370-017-0503-y
@@ Property / DOI: 10.1007/s13370-017-0503-y / rank @@
-Normal rank
@@ Property / author @@
-Phillip Mafuta
@@ Property / author: Phillip Mafuta / rank @@
-Normal rank
@@ Property / author @@
+Phillip Mafuta
@@ Property / author: Phillip Mafuta / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s13370-017-0503-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2612436277
@@ Property / OpenAlex ID: W2612436277 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal spanning trees with a constraint on the number of leaves
+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 @@
+Sufficient conditions for a graph to be Hamiltonian
+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 @@
+Minimum Degree, Leaf Number, and Hamiltonicity
@@ Property / cites work: Minimum Degree, Leaf Number, and Hamiltonicity / 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 @@
+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 @@
+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 @@
+Some Theorems on Abstract Graphs
@@ Property / cites work: Some Theorems on Abstract Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A generalization of Ore's Theorem involving neighborhood unions
+Normal rank
@@ Property / cites work @@
+A sufficient condition for graphs with large neighborhood unions to be traceable
+Normal rank
@@ Property / cites work @@
+Hamiltonian cycles in 2‐connected claw‐free‐graphs
+Normal rank
@@ Property / cites work @@
+Q4722095
@@ Property / cites work: Q4722095 / rank @@
+Normal rank
@@ Property / cites work @@
+Neighborhood unions and hamilton cycles
@@ Property / cites work: Neighborhood unions and hamilton cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Neighbourhood unions and Hamiltonian properties in graphs
+Normal rank
@@ Property / cites work @@
+Note on Hamilton Circuits
@@ Property / cites work: Note on Hamilton Circuits / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S13370-017-0503-Y
@@ Property / DOI: 10.1007/S13370-017-0503-Y / rank @@
+Normal rank