Cycle decompositions of \(K_n\) and \(K_n-I\)

DOI10.1006/jctb.2000.1996zbMath1023.05112OpenAlexW2068457180MaRDI QIDQ1850511

Publication date: 10 December 2002

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

Full work available at URL: https://doi.org/10.1006/jctb.2000.1996

zbMATH Keywords

complete graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (only showing first 100 items - show all)

Small embeddings for partial 5-cycle systems ⋮ Some equitably 3-colourable cycle decompositions ⋮ Cycle systems in the complete bipartite graph minus a one-factor ⋮ On the cyclic decomposition of complete graphs into almost-bipartite graphs ⋮ \(C_7\)-decompositions of the tensor product of complete graphs ⋮ Decompositions of complete graphs into bipartite 2-regular subgraphs ⋮ \(C_{p}\)-decompositions of some regular graphs ⋮ Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even ⋮ Decompositions of complete graphs into circulants ⋮ \(C_{4p}\)-frame of complete multipartite multigraphs ⋮ \(2p\)-cycle decompositions of some regular graphs and digraphs ⋮ Decomposition of complete multigraphs into crown graphs ⋮ On the existence of unparalleled even cycle systems ⋮ A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\) ⋮ Nonisomorphic maximum packing and minimum covering of \(K_v\) with 8-cycles ⋮ Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\) ⋮ Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs ⋮ Difference families in \(\text{Z}_{2d+1}\oplus \text{Z}_{2d+1}\) and infinite translation designs in \(\text{Z} \oplus \text{Z}\) ⋮ Equipartite gregarious 6- and 8-cycle systems ⋮ On tight 6-cycle decompositions of complete 3-uniform hypergraphs ⋮ Odd-cycle systems with prescribed automorphism groups ⋮ Cubic factorizations ⋮ Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cycles ⋮ On Decomposing the Complete Graph into the Union of Two Disjoint Cycles ⋮ Decomposing various graphs into short even-length cycles ⋮ Decomposition of complete bipartite graphs into paths and cycles ⋮ Decomposition of complete multigraphs into stars and cycles ⋮ Graph decomposition methods for variance balanced block designs with correlated errors ⋮ Almost resolvable maximum packings of complete graphs with 5-cycles ⋮ A new class for large sets of almost Hamilton cycle decompositions ⋮ Some equitably 3-colorable cycle decompositions of \(K_v + 1\) ⋮ Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles ⋮ Amalgamations of connected \(k\)-factorizations. ⋮ Decomposing complete equipartite graphs into odd square-length cycles: number of parts even ⋮ Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor ⋮ On the existence of \(k\)-sun systems ⋮ Perfect 7-cycle systems ⋮ Perfect octagon quadrangle systems with upper \(C_4\)-systems ⋮ Decomposition of complete graphs into cycles and stars ⋮ On the existence of cycle frames and almost resolvable cycle systems ⋮ Sunlet decomposition of certain equipartite graphs ⋮ Completing the spectrum of almost resolvable cycle systems with odd cycle length ⋮ On cycle systems with specified weak chromatic number ⋮ An asymptotic solution to the cycle decomposition problem for complete graphs ⋮ Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6 ⋮ Resolvable gregarious cycle decompositions of complete equipartite graphs ⋮ All graphs with maximum degree three whose complements have 4-cycle decompositions ⋮ The generalized almost resolvable cycle system problem ⋮ Cyclic Hamiltonian cycle systems of the complete graph. ⋮ Corrigendum to: ``Cycle decompositions of \(K_n\) and \(K_n - I\) ⋮ Round-robin tournaments with homogeneous rounds ⋮ Large sets of Hamilton cycle decompositions of complete bipartite graphs ⋮ On cyclic decompositions of the complete graph into the 2-regular graphs ⋮ Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each ⋮ Cycle decompositions of complete digraphs ⋮ 4-cycle systems of \(K_n-E(F^\ast)\) ⋮ Decomposing certain equipartite graphs into sunlet graphs of length \(2p\) ⋮ Packing cycles in complete graphs ⋮ Large sets of Hamilton cycle and path decompositions ⋮ Hexagon quadrangle systems ⋮ Resolvable 4-cycle group divisible designs with two associate classes: part size even ⋮ Colouring even cycle systems ⋮ Maximum cyclic 4-cycle packings of the complete multipartite graph ⋮ Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\) ⋮ Pack graphs with subgraphs of size three ⋮ A subspace covering problem in the \(n\)-cube ⋮ Decompositions of complete multigraphs into cycles of varying lengths ⋮ Arc-transitive cycle decompositions of tetravalent graphs ⋮ Equipartite gregarious 5-cycle systems and other results ⋮ Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts ⋮ Decompositions of complete graphs into blown-up cycles \(C_m\)[2] ⋮ Maximum packings and minimum coverings of \(K_{v}\) with octagons ⋮ Perfect octagon quadrangle systems ⋮ Decompositions into 2-regular subgraphs and equitable partial cycle decompositions ⋮ Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs ⋮ Perfect dodecagon quadrangle systems ⋮ Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs ⋮ More results on cycle frames and almost resolvable cycle systems ⋮ Cycle decompositions III: Complete graphs and fixed length cycles ⋮ Resolvable even cycle decompositions of the tensor product of complete graphs ⋮ How many circuits determine an oriented matroid? ⋮ Hexagon kite systems ⋮ 5-cycle systems of \((\lambda + m) K_{v + 1} - \lambda K_v\) and \(\lambda K_{v + u} - \lambda K_v\) ⋮ Decomposition of complete graphs into arbitrary trees ⋮ The spectrum problem for the connected cubic graphs of order 10 ⋮ Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph ⋮ On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\) ⋮ Sparse graphs which decompose into closed trails of arbitrary lengths ⋮ Doyen-Wilson Results for Odd Length Cycle Systems ⋮ Path and cycle decompositions of complete equipartite graphs: Four parts ⋮ On Complete (s,t)-Cycle Systems of Complete Graphs ⋮ A solution to the forest leave problem for partial 6-cycle systems ⋮ Cyclically decomposing the complete graph into cycles ⋮ On the existence of elementary Abelian cycle systems ⋮ A non-existence result on cyclic cycle-decompositions of the cocktail party graph ⋮ Directed paths of diagonals within polygons ⋮ Some constructions for cyclic perfect cycle systems ⋮ Brian Alspach and his work ⋮ Decomposition of complete equipartite graphs into paths and cycles of length \(2p\) ⋮ Decomposition of the Kneser graph into paths of length four

Cites Work

This page was built for publication: Cycle decompositions of \(K_n\) and \(K_n-I\)