On a \(k\)-tree containing specified leaves in a graph
From MaRDI portal
Publication:855299
DOI10.1007/s00373-006-0660-5zbMath1108.05028MaRDI QIDQ855299
Haruhide Matsuda, Hajime Matsumura
Publication date: 5 January 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-006-0660-5
Related Items
Chvátal–Erdős Theorem: Old Theorem with New Aspects, Spanning \(k\)-trees of bipartite graphs, A \(k\)-tree containing specified vertices, Spanning trees: A survey, Spanning \(k\)-trees of \(n\)-connected graphs, Spanning trees with a bounded number of branch vertices in a claw-free graph, On a spanning \(k\)-tree in which specified vertices have degree less than \(k\), The independence number condition for the existence of a spanning f-tree
Cites Work