Partitions of Graphs into Trees

DOI10.1007/978-3-540-70904-6_41zbMATH Open1185.05113OpenAlexW1580851525MaRDI QIDQ3595491FDOQ3595491

Authors: Therese Biedl, Franz J. Brandenburg 

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

Recommendations

• scientific article; zbMATH DE number 4108779
• scientific article; zbMATH DE number 672025
• On the complexity of partitioning graphs into connected subgraphs
• scientific article; zbMATH DE number 1262808
• Tree-partitions of \(k\)-trees with applications in graph layout.

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (17)

• Tree-partitions of infinite graphs
• Bijective counting of plane bipolar orientations
• Partitioning complete graphs by heterochromatic trees
• On tree partitions
• Rooted routing in the plane
• Graph Drawing
• Pairs of trees in tree--tree triangulations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bijective counting of plane bipolar orientations and Schnyder woods
• Title not available (Why is that?)
• Partitionability of trees
• TREE STRUCTURES ON CERTAIN FAMILIES OF PARTITIONS
• Tree‐based Graph Partitioning Constraint
• Hypertrees, rooted trees and pointed partitions

This page was built for publication: Partitions of Graphs into Trees

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