Packing Circuits into KN
From MaRDI portal
Publication:2777895
DOI10.1017/S0963548301004771zbMath1113.05309MaRDI QIDQ2777895
Publication date: 13 March 2002
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (23)
Decomposing complete multipartite graphs into closed trails of arbitrary even lengths ⋮ Decomposition of Complete Bipartite Even Graphs into Closed Trails ⋮ Decomposing complete equipartite graphs into closed trails of length \(k\) ⋮ Edge-disjoint open trails in complete bipartite multigraphs ⋮ Achromatic number of collections of paths and cycles ⋮ Decomposing complete equipartite graphs into odd square-length cycles: number of parts even ⋮ Packing closed trails into dense graphs. ⋮ An asymptotic solution to the cycle decomposition problem for complete graphs ⋮ Balanced edge colorings. ⋮ Edge-distinguishing index of a graph ⋮ Packing cycles in complete graphs ⋮ On arbitrarily vertex decomposable trees ⋮ Vertex-distinguishing proper edge colourings of some regular graphs ⋮ Closed trail decompositions of complete equipartite graphs ⋮ On planar graphs arbitrarily decomposable into closed trails ⋮ Decompositions into 2-regular subgraphs and equitable partial cycle decompositions ⋮ Almost regular edge colorings and regular decompositions of complete graphs ⋮ Decomposing complete tripartite graphs into closed trails of arbitrary lengths ⋮ Cycle decompositions of complete multigraphs ⋮ Sparse graphs which decompose into closed trails of arbitrary lengths ⋮ Arbitrary decompositions into open and closed trails ⋮ Closed trail decompositions of some classes of regular graphs ⋮ Decompositions of pseudographs into closed trails of even sizes
This page was built for publication: Packing Circuits into KN
