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

DOI10.1016/0095-8956(81)90093-9zbMATH Open0463.05048OpenAlexW1963501983MaRDI QIDQ1153099FDOQ1153099

Authors: D. 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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Decomposition of the complete directed graph into k-circuits

Cited In (only showing first 100 items - show all)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1153099)