Learn More

- Mirko Hornák, Zuzana Kocková
- Graphs and Combinatorics
- 2008

A graph G is arbitrarily decomposable into closed trails (ADCT) if the following is true: Whenever (l 1 ,. .. , l p) is a sequence of integers adding up to |E(G)| and there is a closed trail of length l i in G for i = 1,. .. , p, then there is a sequence (T 1 ,. .. , T p) of pairwise edge-disjoint closed trails in G such that T i is of length l i for i =… (More)

- ‹
- 1
- ›