Spanning k-trees of n-connected graphs

DOI10.1007/S00373-011-1021-6MaRDI QIDQ659713zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Closure and spanning \(k\)-trees
• Spanning \(k\)-tree with specified vertices
• A forbidden pair for connected graphs to have spanning k‐trees
• A note on a spanning 3-tree
• On low bound of degree sequences of spanning trees inK-edge-connected graphs

Cites work

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

Cited in

(25)

• The Existence of an Alternating Sign on a Spanning Tree of Graphs
• A note on total excess of spanning trees
• scientific article; zbMATH DE number 6770102 (Why is no real title available?)
• scientific article; zbMATH DE number 6719738 (Why is no real title available?)
• scientific article; zbMATH DE number 5054175 (Why is no real title available?)
• scientific article; zbMATH DE number 2192218 (Why is no real title available?)
• Spanning \(k\)-tree with specified vertices
• On the SPANNING \(k\)-TREE problem
• On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs
• \(k\)-ary spanning trees contained in tournaments
• On a spanning \(K\)-tree containing specified vertices in a graph
• Spanning trees of descendants of a complete graph
• Closure and spanning trees with bounded total excess
• Closure and spanning \(k\)-trees
• A forbidden pair for connected graphs to have spanning k‐trees
• \(m\)-dominating \(k\)-trees of graphs
• \(m\)-dominating \(k\)-ended trees of \(l\)-connected graphs
• Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
• scientific article; zbMATH DE number 5499264 (Why is no real title available?)
• Spanning \(k\)-trees of bipartite graphs
• Pendant tree-connectivity
• Natural spanning trees of \({\mathbb{Z}}^ d\) are recurrent
• Closure for spanning trees and distant area
• On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)
• Spanning trees: A survey

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

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