Edge Partition of Toroidal Graphs into Forests in Linear Time
From MaRDI portal
(Redirected from Edge Partition of Toroidal Graphs into Forests in Linear Time)
Recommendations
Cites work
Cited in
(9)- The structure of \(K_{3,3}\)-subdivision-free toroidal graphs
- Decomposing toroidal graphs into circuits and edges
- scientific article; zbMATH DE number 4108779 (Why is no real title available?)
- scientific article; zbMATH DE number 2075844 (Why is no real title available?)
- scientific article; zbMATH DE number 7366688 (Why is no real title available?)
- Embedding graphs in the torus in linear time
- Schnyder woods for higher genus triangulated surfaces (abstract)
- Computation of toroidal Schnyder woods made simple and fast: from theory to practice
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding
This page was built for publication: Edge Partition of Toroidal Graphs into Forests in Linear Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439375)