Splitting trees at vertices

DOI10.1016/j.disc.2010.09.024zbMath1225.05084OpenAlexW1974559507MaRDI QIDQ616363

Jens Vygen

Publication date: 7 January 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.09.024

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• Unnamed Item
• Unnamed Item
• A partial k-arboretum of graphs with bounded treewidth
• Easy problems for tree-decomposable graphs
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• A Faster Algorithm for the Steiner Tree Problem

This page was built for publication: Splitting trees at vertices