Decomposition of bipartite graphs into closed trails

作者：Cichacz Sylwia^*; Hornak Mirko

来源：Czechoslovak Mathematical Journal, 2009, 59(1): 129-144.

DOI：10.1007/s10587-009-0009-3

• even graph
• closed trail
• graph arbitrarily decomposable into closed trails
• bipartite graph

Let Lct(G) denote the set of all lengths of closed trails that exist in an even graph G. A sequence (t (1),..., t (p) ) of elements of Lct(G) adding up to vertical bar E(G)vertical bar is G-realisable provided there is a sequence (T (1),..., t (p) ) of pairwise edge-disjoint closed trails in G such that T (i) is of length T (i) for i = 1,..., p. The graph G is arbitrarily decomposable into closed trails if all possible sequences are G-realisable.

• 出版日期2009-3