On Planar Graphs Arbitrarily Decomposable into Closed Trails


A graph G is arbitrarily decomposable into closed trails (ADCT) if the following is true: Whenever (l1, . . . , lp) is a sequence of integers adding up to |E(G)| and there is a closed trail of length li in G for i = 1, . . . , p, then there is a sequence (T1, . . . , Tp) of pairwise edge-disjoint closed trails in G such that Ti is of length li for i = 1… (More)
DOI: 10.1007/s00373-007-0766-4


4 Figures and Tables