Spanning k-trees of n-connected graphs

DOI10.1007/S00373-011-1021-6zbMATH Open1235.05032OpenAlexW2075810525MaRDI QIDQ659713FDOQ659713

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Cites Work

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

Cited In (22)

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

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)