A \(k\)-tree containing specified vertices

DOI10.1007/s00373-010-0903-3zbMath1221.05044OpenAlexW2041774742MaRDI QIDQ604665

Kenta Ozeki, Shuya Chiba, Ryota Matsubara, Masao Tsugaki

Publication date: 12 November 2010

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

Full work available at URL: https://doi.org/10.1007/s00373-010-0903-3

zbMATH Keywords

\(k\)-treedegree sumspecified vertices

Mathematics Subject Classification ID

Trees (05C05)

Related Items (2)

Independence number and \(k\)-trees of graphs ⋮ A note on the independence number, connectivity and \(k\)-ended tree

Cites Work

• Unnamed Item
• Degree bounded spanning trees
• Cycles through specified vertices
• On a \(k\)-tree containing specified leaves in a graph
• A degree sum condition concerning the connectivity and the independence number of a graph
• Degree conditions and degree bounded trees
• Trees through specified vertices
• On a connection between the existence of k-trees and the toughness of a graph
• Spanning trees with bounded degrees
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• Cycles through subsets with large degree sums
• Cycles through given vertices and closures
• Cycles through prescribed vertices with large degree sum
• A note on Hamiltonian circuits
• Note on Hamilton Circuits
• 2‐neighborhoods and hamiltonian conditions
• Cyclability of 3-connected graphs
• Sequences, claws and cyclability of graphs
• Toughness, trees, and walks
• A sufficient condition for a graph to have a \(k\)-tree
• Cyclability and pancyclability in bipartite graphs

This page was built for publication: A \(k\)-tree containing specified vertices