Decomposing toroidal graphs into circuits and edges

DOI10.1016/J.DAM.2004.10.006zbMath1071.05062OpenAlexW2126380436MaRDI QIDQ2486748

Lusheng Wang, Bao-Gang Xu

Publication date: 17 August 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.10.006

zbMATH Keywords

TorusDecomposition

Mathematics Subject Classification ID

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

Cites Work

• Hajós' conjecture and small cycle double covers of planar graphs
• Hajós' conjecture and projective graphs
• The Representation of a Graph by Set Intersections
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposing toroidal graphs into circuits and edges