Pages that link to "Item:Q2782295"
From MaRDI portal
The following pages link to Cycle decompositions III: Complete graphs and fixed length cycles (Q2782295):
Displaying 50 items.
- Decompositions of complete graphs into bipartite 2-regular subgraphs (Q281575) (← links)
- Decompositions of complete graphs into circulants (Q294538) (← links)
- On the existence of unparalleled even cycle systems (Q326644) (← links)
- Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\) (Q354461) (← links)
- Odd-cycle systems with prescribed automorphism groups (Q383339) (← links)
- Decomposition of complete bipartite graphs into paths and cycles (Q397156) (← links)
- Some equitably 3-colorable cycle decompositions of \(K_v + 1\) (Q409404) (← links)
- Decomposing complete equipartite graphs into odd square-length cycles: number of parts even (Q418858) (← links)
- On the existence of \(k\)-sun systems (Q427839) (← links)
- Round-robin tournaments with homogeneous rounds (Q475180) (← links)
- 4-cycle systems of \(K_n-E(F^\ast)\) (Q497370) (← links)
- Decomposing certain equipartite graphs into sunlet graphs of length \(2p\) (Q504158) (← links)
- A subspace covering problem in the \(n\)-cube (Q516772) (← links)
- On the existence of cycle frames and almost resolvable cycle systems (Q641197) (← links)
- The generalized almost resolvable cycle system problem (Q653836) (← links)
- Decompositions of complete multigraphs into cycles of varying lengths (Q684123) (← links)
- Decompositions into 2-regular subgraphs and equitable partial cycle decompositions (Q707023) (← links)
- More results on cycle frames and almost resolvable cycle systems (Q713167) (← links)
- A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\) (Q855298) (← links)
- On the stability properties of linear dynamic time-varying unforced systems involving switches between parameterizations from topologic considerations via graph theory (Q858295) (← links)
- Difference families in \(\text{Z}_{2d+1}\oplus \text{Z}_{2d+1}\) and infinite translation designs in \(\text{Z} \oplus \text{Z}\) (Q878054) (← links)
- Equipartite gregarious 6- and 8-cycle systems (Q879343) (← links)
- Decomposition of complete multigraphs into stars and cycles (Q891309) (← links)
- Almost resolvable maximum packings of complete graphs with 5-cycles (Q893340) (← links)
- Resolvable gregarious cycle decompositions of complete equipartite graphs (Q924973) (← links)
- All graphs with maximum degree three whose complements have 4-cycle decompositions (Q924981) (← links)
- Hamilton cycle decompositions of the tensor product of complete multipartite graphs (Q932683) (← links)
- Large sets of Hamilton cycle decompositions of complete bipartite graphs (Q932831) (← links)
- Packing cycles in complete graphs (Q947728) (← links)
- Large sets of Hamilton cycle and path decompositions (Q947816) (← links)
- Arc-transitive cycle decompositions of tetravalent graphs (Q958681) (← links)
- Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts (Q960919) (← links)
- Decompositions of complete graphs into blown-up cycles \(C_m\)[2] (Q966036) (← links)
- Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs (Q976170) (← links)
- Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph (Q1011715) (← links)
- Sparse graphs which decompose into closed trails of arbitrary lengths (Q1015428) (← links)
- Path and cycle decompositions of complete equipartite graphs: Four parts (Q1025923) (← links)
- On the existence of elementary Abelian cycle systems (Q1043796) (← links)
- A non-existence result on cyclic cycle-decompositions of the cocktail party graph (Q1044940) (← links)
- Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles (Q1399917) (← links)
- Amalgamations of connected \(k\)-factorizations. (Q1400963) (← links)
- Perfect 7-cycle systems (Q1408464) (← links)
- Cyclic Hamiltonian cycle systems of the complete graph. (Q1428516) (← links)
- \(2p\)-cycle decompositions of some regular graphs and digraphs (Q1637135) (← links)
- 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 (Q1678094) (← links)
- A new class for large sets of almost Hamilton cycle decompositions (Q1690556) (← links)
- Completing the spectrum of almost resolvable cycle systems with odd cycle length (Q1709552) (← links)
- A solution to the forest leave problem for partial 6-cycle systems (Q1827694) (← links)
- Cyclically decomposing the complete graph into cycles (Q1827757) (← links)
- Some equitably 3-colourable cycle decompositions (Q1876670) (← links)
