Minimum Cycle Decomposition: A Constructive Characterization for Graphs of Treewidth Two with Node Degrees Two and Four
Abstract
Substantial efforts have been made to compute or estimate the minimum number c(G) of cycles needed to partition the edges of an Eulerian graph. We give an equivalent characterization of Eulerian graphs of treewidth 2 and with maximum degree 4. This characterization enables us to present a linear time algorithm for the computation of c(G) for all G in this class.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.