Packing closed trails into dense graphs.

DOI10.1016/S0095-8956(02)00039-4zbMath1045.05074OpenAlexW2043912076MaRDI QIDQ1405105

Paul N. Balister

Publication date: 25 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0095-8956(02)00039-4

zbMATH Keywords

packingdense graphsclosed trailsAlspach's hypothesis

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (10)

Partitioning powers of traceable or Hamiltonian graphs ⋮ An asymptotic solution to the cycle decomposition problem for complete graphs ⋮ On arbitrarily vertex decomposable trees ⋮ On planar graphs arbitrarily decomposable into closed trails ⋮ Decomposing dense bipartite graphs into 4-cycles ⋮ Decomposition of bipartite graphs into closed trails ⋮ Decomposing complete tripartite graphs into closed trails of arbitrary lengths ⋮ Sparse graphs which decompose into closed trails of arbitrary lengths ⋮ Decompositions of pseudographs into closed trails of even sizes ⋮ Decomposing Graphs of High Minimum Degree into 4‐Cycles

Cites Work

• Unnamed Item
• On the Alspach Conjecture
• Packing Circuits into K_N
• List decomposition of graphs.

This page was built for publication: Packing closed trails into dense graphs.