The connectivities of leaf graphs of 2-connected graphs

DOI10.1006/JCTB.1998.1895zbMATH Open0932.05048OpenAlexW2007722430MaRDI QIDQ1306305FDOQ1306305

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

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.

zbMATH Keywords

spanning treehamiltonianbiconnectedleaf graph

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Cites Work

• On the Tree Graph of a Matroid
• A homology theory for spanning tress of a graph
• Title not available (Why is that?)
• A lower bound on connectivities of matroid base graphs

Cited In (5)

• Connectivity and Diagnosability of Leaf-Sort Graphs
• The connectivities of leaf graphs of sets of points in the plane
• Spanning trees: A survey
• Title not available (Why is that?)
• Robust connectivity of graphs on surfaces

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)