Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k

DOI10.1016/0095-8956(81)90093-9zbMath0463.05048OpenAlexW1963501983MaRDI QIDQ1153099

Dominique Sotteau

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0095-8956(81)90093-9

Mathematics Subject Classification ID

Paths and cycles (05C38) Other designs, configurations (05B30)

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

Hamiltonian decompositions of complete regular s-partite graphs ⋮ Equitable block-colorings of \(C_4\)-decompositions of \(K_v-F\) ⋮ Decomposition of cartesian product of complete graphs into sunlet graphs of order eight ⋮ Cycle systems in the complete bipartite graph minus a one-factor ⋮ Colouring 4-cycle systems with equitably coloured blocks ⋮ Maximum packings with odd cycles ⋮ The Doyen-Wilson theorem extended to 5-cycles ⋮ Decomposition of complete bipartite graphs into cycles of distinct even lengths ⋮ \(C_{4p}\)-frame of complete multipartite multigraphs ⋮ \(2p\)-cycle decompositions of some regular graphs and digraphs ⋮ Least common multiple of graphs ⋮ Decomposition of complete multigraphs into crown graphs ⋮ On the existence of unparalleled even cycle systems ⋮ Small embeddings of partial directed cycle systems ⋮ Packings and Coverings of the Complete Bipartite Graph by Octagons ⋮ On m-cycle holey systems ⋮ Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\) ⋮ Decomposing \(K_{u + w} - K_u\) into cycles of prescribed lengths ⋮ Nonisomorphic maximum packing and minimum covering of \(K_v\) with 8-cycles ⋮ \(C_ k\)-factorization of complete bipartite graphs ⋮ Optimal packing of even circuits into a \(\text{DK}_ v\) ⋮ Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars ⋮ Equipartite gregarious 6- and 8-cycle systems ⋮ The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles ⋮ Decomposition of a complete bipartite multigraph into arbitrary cycle sizes ⋮ Forest leaves and four-cycles ⋮ Triple metamorphosis of twofold triple systems ⋮ \(\vec C_4\)-decompositions of \(D_v\backslash P\) and \(D_{v}\cup P\) where \(P\) is a 2-regular subgraph of \(D_{v}\) ⋮ Decomposing various graphs into short even-length cycles ⋮ A novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classes ⋮ Decomposition of the complete bipartite graph with a 1-factor removed into cycles and stars ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Decomposition of complete bipartite graphs into paths and cycles ⋮ Decomposition of complete multigraphs into stars and cycles ⋮ Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges ⋮ Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Decomposing complete equipartite graphs into odd square-length cycles: number of parts even ⋮ Decomposition of complete graphs into cycles and stars ⋮ On Alspach's conjecture ⋮ A survey on the existence ofG-Designs ⋮ On cycle systems with specified weak chromatic number ⋮ All graphs with maximum degree three whose complements have 4-cycle decompositions ⋮ Large sets of Hamilton cycle decompositions of complete bipartite graphs ⋮ Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each ⋮ 4-cycle systems of \(K_n-E(F^\ast)\) ⋮ Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length ⋮ The metamorphosis of \(\lambda\)-fold \(K_4-e\) designs into maximum packings of \(\lambda K_n\) with 4-cycles, \(\lambda \geqslant 2\) ⋮ On the decompositions of complete graphs into cycles and stars on the same number of edges ⋮ Nesting directed cycle systems of even length ⋮ Equipartite and almost-equipartite gregarious 4-cycle systems ⋮ Colouring even cycle systems ⋮ Maximum cyclic 4-cycle packings of the complete multipartite graph ⋮ Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles ⋮ Pack graphs with subgraphs of size three ⋮ Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts ⋮ Embedding partial odd-cycle systems in systems with orders in all admissible congruence classes ⋮ Closed trail decompositions of complete equipartite graphs ⋮ Decompositions of complete graphs into blown-up cycles \(C_m\)[2] ⋮ Decomposition of complete bipartite graphs into generalized prisms ⋮ Cycle decompositions of the line graph of \(K_ n\) ⋮ Maximum packings and minimum coverings of \(K_{v}\) with octagons ⋮ Enclosings of \(\lambda \)-fold 4-cycle systems ⋮ Decomposing dense bipartite graphs into 4-cycles ⋮ Unnamed Item ⋮ Equitable specialized block-colourings for 4-cycle systems-I ⋮ Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs ⋮ Cycle-supermagic decompositions of complete multipartite graphs ⋮ Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd ⋮ Decompositions of some regular graphs into unicyclic graphs of order five ⋮ Block colourings of 6-cycle systems ⋮ Decomposition of product graphs into paths and cycles of length four ⋮ $C_4$-decomposition of the tensor product of complete graphs ⋮ Multidesigns for the graph pair formed by the 6-cycle and 3-prism ⋮ Decomposing complete tripartite graphs into closed trails of arbitrary lengths ⋮ Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation-detachment Approach ⋮ Decompositions of some classes of dense graphs into cycles of lengths 4 and 8 ⋮ \(G\)-designs and related designs ⋮ Embedding partial 4-cycle systems of arbitrary index ⋮ Decomposing complete equipartite graphs into short even cycles ⋮ Unnamed Item ⋮ Six-cycle systems ⋮ Path and cycle decompositions of complete equipartite graphs: Four parts ⋮ On Complete (s,t)-Cycle Systems of Complete Graphs ⋮ Closed trail decompositions of some classes of regular graphs ⋮ DECOMPOSITIONS OF GENERALIZED COMPLETE GRAPHS ⋮ A solution to the forest leave problem for partial 6-cycle systems ⋮ Unnamed Item ⋮ Decomposing complete tripartite graphs into cycles of lengths 3 and 4 ⋮ Decomposition of \(K_{m,n}\) into short cycles ⋮ Some equitably 3-colourable cycle decompositions of complete equipartite graphs ⋮ \((m,n)\)-cycle systems ⋮ Cycle decompositions of \(K_n\) and \(K_n-I\) ⋮ 4-cycle decompositions of \((\lambda +m)K_{v+u} {\setminus } \lambda K_v\) ⋮ Decomposition of complete bipartite graphs into cycles and stars with four edges ⋮ OnH-antimagic decomposition of toroidal grids and triangulations ⋮ Decomposition of the complete bipartite multigraph into cycles and stars ⋮ Primitive cycle decompositions of Kn and Kn−I

Cites Work

• Decomposition of the complete directed graph into k-circuits
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k