On a \(k\)-tree containing specified leaves in a graph

DOI10.1007/S00373-006-0660-5zbMath1108.05028OpenAlexW2026543816MaRDI 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

zbMATH Keywords

Independence numberTreeSpanning subgraphFactorOre

Mathematics Subject Classification ID

Trees (05C05) Eulerian and Hamiltonian graphs (05C45)

Related Items (13)

Spanning trees with bounded degrees and leaves ⋮ Chvátal–Erdős Theorem: Old Theorem with New Aspects ⋮ A \(k\)-tree containing specified vertices ⋮ The existence of \(f\)-forests and \(f\)-trees in graphs ⋮ Spanning trees: A survey ⋮ Spanning \(k\)-trees of \(n\)-connected graphs ⋮ Spanning \(k\)-trees of bipartite graphs ⋮ On a spanning \(k\)-tree in which specified vertices have degree less than \(k\) ⋮ On spanning trees with few branch vertices ⋮ Spanning k-tree with specified vertices ⋮ The independence number condition for the existence of a spanning f-tree ⋮ Spanning trees with a bounded number of branch vertices in a claw-free graph ⋮ On a spanning \(K\)-tree containing specified vertices in a graph

Cites Work

• Unnamed Item
• Hamilton connected graphs
• Spanning trees with bounded degrees
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• Note on Hamilton Circuits
• On Representatives of Subsets

This page was built for publication: On a \(k\)-tree containing specified leaves in a graph