On k-leaf-connected graphs

DOI10.1016/0095-8956(86)90023-7zbMath0599.05041OpenAlexW2007233360MaRDI QIDQ1080438

Yoshiko Wakabayashi, Maria Angela C. M. Gurgel

Publication date: 1986

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(86)90023-7

zbMATH Keywords

Hamilton-connectivityleaf connectivity

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (10)

Improved sufficient conditions for \(k\)-leaf-connected graphs ⋮ Closures, cycles, and paths ⋮ Unnamed Item ⋮ Some sufficient conditions for graphs being \(k\)-leaf-connected ⋮ Wiener-type invariants and \(k\)-leaf-connected graphs ⋮ An improvement of sufficient condition for \(k\)-leaf-connected graphs ⋮ Spanning trees: A survey ⋮ Spanning trees with bounded degrees ⋮ Hamiltonicity in claw-free graphs ⋮ On a spanning tree with specified leaves

Cites Work

• Unnamed Item
• Unnamed Item
• Hamilton connected graphs
• A generalization of the Bondy-Chvátal theorem on the k-closure
• A method in graph theory
• Note on Hamilton Circuits
• On Hamiltonian-connected regular graphs
• THE MAXIMUM CONNECTIVITY OF A GRAPH

This page was built for publication: On k-leaf-connected graphs