Partitions of Graphs into Trees
From MaRDI portal
Publication:3595491
DOI10.1007/978-3-540-70904-6_41zbMath1185.05113OpenAlexW1580851525MaRDI QIDQ3595491
Franz-Josef Brandenburg, Therese C. Biedl
Publication date: 28 August 2007
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70904-6_41
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Bijective counting of plane bipolar orientations ⋮ Bijective counting of plane bipolar orientations and Schnyder woods
This page was built for publication: Partitions of Graphs into Trees
