Spanning \(k\)-trees of \(n\)-connected graphs

DOI10.1007/s00373-011-1021-6zbMath1235.05032OpenAlexW2075810525MaRDI QIDQ659713

Mikio Kano, Hiroo Kishimoto

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1021-6

zbMATH Keywords

spanning treespanning \(k\)-tree\(n\)-connected graphsclosure for \(k\)-tree

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Related Items (3)

Spanning trees: A survey ⋮ Spanning k-tree with specified vertices ⋮ Closure and spanning \(k\)-trees

Cites Work

• On a \(k\)-tree containing specified leaves in a graph
• Spanning trees with bounded degrees
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• A method in graph theory
• Note on Hamilton Circuits
• Independence trees and Hamilton cycles
• Spanning trees of bounded degree

This page was built for publication: Spanning \(k\)-trees of \(n\)-connected graphs