Partitions of Graphs into Trees
From MaRDI portal
Publication:3595491
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)
Recommendations
Cited in
(17)- Hypertrees, rooted trees and pointed partitions
- Tree-partitions of infinite graphs
- Partitioning complete graphs by heterochromatic trees
- Bijective counting of plane bipolar orientations
- On tree partitions
- Rooted routing in the plane
- Pairs of trees in tree--tree triangulations
- Graph Drawing
- scientific article; zbMATH DE number 5526012 (Why is no real title available?)
- scientific article; zbMATH DE number 672025 (Why is no real title available?)
- scientific article; zbMATH DE number 19193 (Why is no real title available?)
- scientific article; zbMATH DE number 4108779 (Why is no real title available?)
- Bijective counting of plane bipolar orientations and Schnyder woods
- scientific article; zbMATH DE number 434481 (Why is no real title available?)
- Partitionability of trees
- TREE STRUCTURES ON CERTAIN FAMILIES OF PARTITIONS
- Tree‐based Graph Partitioning Constraint
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)