The following pages link to (Q5421810):
Displaying 22 items.
- Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking (Q313805) (← links)
- Decomposition of the complete bipartite graph with a 1-factor removed into cycles and stars (Q393471) (← links)
- The complexity of the empire colouring problem (Q476435) (← links)
- Decompositions of multicrowns into cycles and stars (Q514927) (← links)
- Decompositions of complete multigraphs into cycles of varying lengths (Q684123) (← links)
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs (Q712220) (← links)
- Packing cycles in complete graphs (Q947728) (← links)
- Packing paths in complete graphs (Q965248) (← 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)
- Error-correcting codes from permutation groups (Q1043942) (← links)
- Decomposing various graphs into short even-length cycles (Q1928579) (← links)
- An asymptotic solution to the cycle decomposition problem for complete graphs (Q1957980) (← links)
- Six-cycle systems (Q2054649) (← links)
- Decomposition of the complete bipartite multigraph into cycles and stars (Q2342622) (← links)
- Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs (Q2342629) (← links)
- On cyclic Hamiltonian decompositions of complete \(k\)-uniform hypergraphs (Q2449142) (← links)
- Decomposition of complete bipartite graphs into cycles of distinct even lengths (Q2631082) (← links)
- A novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classes (Q2672548) (← links)
- Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem (Q3104775) (← links)
- Computer search for graceful labeling: a survey (Q5081235) (← links)
- Decomposition of cartesian product of complete graphs into sunlet graphs of order eight (Q5884129) (← links)
