Pages that link to "Item:Q1850511"
From MaRDI portal
The following pages link to Cycle decompositions of \(K_n\) and \(K_n-I\) (Q1850511):
Displaying 50 items.
- 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)
- How many circuits determine an oriented matroid? (Q1786051) (← 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)
- Cycle systems in the complete bipartite graph minus a one-factor (Q1876671) (← links)
- On the cyclic decomposition of complete graphs into almost-bipartite graphs (Q1876676) (← links)
- Decomposing various graphs into short even-length cycles (Q1928579) (← links)
- Decomposition of complete graphs into cycles and stars (Q1950399) (← links)
- Sunlet decomposition of certain equipartite graphs (Q1953667) (← links)
- On cycle systems with specified weak chromatic number (Q1957974) (← links)
- An asymptotic solution to the cycle decomposition problem for complete graphs (Q1957980) (← links)
- Pack graphs with subgraphs of size three (Q1990360) (← links)
- Decomposition of complete graphs into arbitrary trees (Q2042202) (← links)
- The spectrum problem for the connected cubic graphs of order 10 (Q2042609) (← links)
- Decomposition of complete equipartite graphs into paths and cycles of length \(2p\) (Q2092386) (← links)
- Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even (Q2132407) (← links)
- Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6 (Q2214321) (← links)
- Corrigendum to: ``Cycle decompositions of \(K_n\) and \(K_n - I\)'' (Q2221937) (← links)
- Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each (Q2227107) (← links)
- Cycle decompositions of complete digraphs (Q2227833) (← links)
- Resolvable even cycle decompositions of the tensor product of complete graphs (Q2275406) (← links)
- On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\) (Q2299995) (← links)
- Decomposition of the Kneser graph into paths of length four (Q2342612) (← links)
- \(C_7\)-decompositions of the tensor product of complete graphs (Q2364075) (← links)
- \(C_{p}\)-decompositions of some regular graphs (Q2368932) (← links)
- \(C_{4p}\)-frame of complete multipartite multigraphs (Q2375912) (← links)
- Decomposition of complete multigraphs into crown graphs (Q2380876) (← links)
- Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor (Q2427503) (← links)
- Perfect octagon quadrangle systems with upper \(C_4\)-systems (Q2431566) (← links)
- On cyclic decompositions of the complete graph into the 2-regular graphs (Q2454980) (← links)
- Hexagon quadrangle systems (Q2468002) (← links)
- Resolvable 4-cycle group divisible designs with two associate classes: part size even (Q2468011) (← links)
- Colouring even cycle systems (Q2470468) (← links)
- Maximum cyclic 4-cycle packings of the complete multipartite graph (Q2471047) (← links)
- Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\) (Q2471048) (← links)
- Equipartite gregarious 5-cycle systems and other results (Q2478170) (← links)
- 5-cycle systems of \((\lambda + m) K_{v + 1} - \lambda K_v\) and \(\lambda K_{v + u} - \lambda K_v\) (Q2514161) (← links)
- Directed paths of diagonals within polygons (Q2568469) (← links)
- Some constructions for cyclic perfect cycle systems (Q2568471) (← links)
- Brian Alspach and his work (Q2568489) (← links)
- Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs (Q2663994) (← links)
- On tight 6-cycle decompositions of complete 3-uniform hypergraphs (Q2666573) (← links)
- Graph decomposition methods for variance balanced block designs with correlated errors (Q2676912) (← links)
- Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs (Q2781050) (← links)
- Cycle decompositions. III: Complete graphs and fixed length cycles. (Q2782295) (← links)
- Doyen-Wilson results for odd length cycle systems (Q2816379) (← links)
- On Complete (<i>s,t</i>)-Cycle Systems of Complete Graphs (Q2831827) (← links)
