Edge Partition of Toroidal Graphs into Forests in Linear Time

DOI10.1016/j.endm.2005.06.065zbMath1200.05216OpenAlexW2079215340MaRDI QIDQ3439375

Cyril Gavoille, Nicolas Bonichon, Arnaud Labourel

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.065

zbMATH Keywords

graph algorithmspanning treegraph partitionSchnyder treesgraph on surfaces

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Schnyder woods for higher genus triangulated surfaces, with applications to encoding ⋮ Schnyder woods for higher genus triangulated surfaces (abstract)

Cites Work

• Unnamed Item
• Five-coloring maps on surfaces
• Bounds of the number of disjoint spanning trees
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• On the independence ratio of a graph
• Embedding graphs in the torus in linear time

This page was built for publication: Edge Partition of Toroidal Graphs into Forests in Linear Time