The connectivities of leaf graphs of 2-connected graphs

DOI10.1006/JCTB.1998.1895MaRDI QIDQ1306305zbMATH OpenOpenAlexFDO

Authors Atsushi Kaneko, Kiyoshi Yoshimoto

Publication date 20 December 1999

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

Full work available at URL https://doi.org/10.1006/jctb.1998.1895

zbMATH Keywords

spanning treehamiltonianbiconnectedleaf graph

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 1109399
• On k-leaf-connected graphs
• Improved sufficient conditions for \(k\)-leaf-connected graphs
• Minimum degree, leaf number, and hamiltonicity
• Minimum degree, leaf number and traceability.

Cites work

• scientific article; zbMATH DE number 1109399 (Why is no real title available?)
• A homology theory for spanning tress of a graph
• A lower bound on connectivities of matroid base graphs
• On the Tree Graph of a Matroid

Cited in

(5)

• scientific article; zbMATH DE number 2192218 (Why is no real title available?)
• Connectivity and Diagnosability of Leaf-Sort Graphs
• The connectivities of leaf graphs of sets of points in the plane
• Robust connectivity of graphs on surfaces
• Spanning trees: A survey

This page was built for publication: The connectivities of leaf graphs of 2-connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306305)