Packing closed trails into dense graphs

Authors:
P. N. Balister
Affiliations:
Department of Mathematical Sciences, University of Memphis, Memphis, TN
Venue:
Journal of Combinatorial Theory Series B
Year:
2003

Citing 3
Cited 3

List decomposition of graphs

Discrete Mathematics
Packing Circuits into KN

Combinatorics, Probability and Computing
On the Alspach Conjecture

Combinatorics, Probability and Computing

Packing Digraphs with Directed Closed Trails

Combinatorics, Probability and Computing
An asymptotic solution to the cycle decomposition problem for complete graphs

Journal of Combinatorial Theory Series A
Note: Partitioning powers of traceable or hamiltonian graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

It has been shown (Combin. Probab. Comput. 10 (2001) 463-499) that if n is odd and m1,...,mt are integers with mi ≥ 3 and Σi=1t mi = |E(Kn)| then Kn can be decomposed as an edge-disjoint union of closed trails of lengths m1,...,mt. Here we show that the corresponding result is also true for any sufficiently large and sufficiently dense even graph G.