Partitions of Graphs into Trees
From MaRDI portal
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cited in
(18)- Bijective counting of plane bipolar orientations and Schnyder woods
- Tree-partitions of infinite graphs
- Rooted routing in the plane
- On tree partitions
- scientific article; zbMATH DE number 434481 (Why is no real title available?)
- Tree‐based Graph Partitioning Constraint
- Bijective counting of plane bipolar orientations
- scientific article; zbMATH DE number 5526012 (Why is no real title available?)
- Partitionability of trees
- scientific article; zbMATH DE number 4108779 (Why is no real title available?)
- scientific article; zbMATH DE number 19193 (Why is no real title available?)
- scientific article; zbMATH DE number 36198 (Why is no real title available?)
- scientific article; zbMATH DE number 672025 (Why is no real title available?)
- TREE STRUCTURES ON CERTAIN FAMILIES OF PARTITIONS
- Graph Drawing
- Partitioning complete graphs by heterochromatic trees
- Hypertrees, rooted trees and pointed partitions
- Pairs of trees in tree--tree triangulations
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)