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

Cites work

scientific article; zbMATH DE number 3758364 (Why is no real title available?)
scientific article; zbMATH DE number 3517174 (Why is no real title available?)
Decomposition of the complete directed graph into k-circuits

Cited in

(only showing first 100 items - show all)

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

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)