Decomposing toroidal graphs into circuits and edges

DOI10.1016/J.DAM.2004.10.006zbMATH Open1071.05062OpenAlexW2126380436MaRDI QIDQ2486748FDOQ2486748

Authors: Lusheng Wang, Baogang 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

Recommendations

• Edge Partition of Toroidal Graphs into Forests in Linear Time
• Decomposing graphs into edges and triangles
• Decomposing random graphs into few cycles and edges
• Decomposing series-parallel graphs into paths of length 3 and triangles
• Path and cycle decompositions of dense graphs

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Representation of a Graph by Set Intersections
• Hajós' conjecture and small cycle double covers of planar graphs
• Title not available (Why is that?)
• Hajós' conjecture and projective graphs

Cited In (5)

• Decomposition of toroidal graphs without some subgraphs
• Dense bipartite circulants and their routing via rectangular twisted torus
• Title not available (Why is that?)
• Edge Partition of Toroidal Graphs into Forests in Linear Time
• Edge-disjoint circuits in graphs on the torus

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486748)