A k-tree containing specified vertices

DOI10.1007/S00373-010-0903-3MaRDI QIDQ604665zbMATH OpenOpenAlexFDO

Authors Shuya Chiba, Ryota Matsubara, Kenta Ozeki, 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

degree sum\(k\)-treespecified vertices

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• On a spanning \(K\)-tree containing specified vertices in a graph
• On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)
• On a k-tree containing specified leaves in a graph
• Independence number and \(k\)-trees of graphs
• Spanning \(k\)-tree with specified vertices

Cites work

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

Cited in

(7)

• Independence number and \(k\)-trees of graphs
• Spanning \(k\)-tree with specified vertices
• On a \(k\)-tree containing specified leaves in a graph
• On a spanning \(K\)-tree containing specified vertices in a graph
• Degree conditions and degree bounded trees
• Forbidden subgraphs and the existence of spanning \(k\)-trees
• A note on the independence number, connectivity and \(k\)-ended tree

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

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