4-cycle systems of K_n-E(F^)
From MaRDI portal
Recommendations
- Cyclically near‐resolvable 4‐cycle systems of 2Kv
- Enclosings of \(\lambda \)-fold 4-cycle systems
- scientific article; zbMATH DE number 4075123
- Embedding partial 4-cycle systems of arbitrary index
- 4-cycle decompositions of \((\lambda +m)K_{v+u} {\setminus } \lambda K_v\)
- Doubly resolvable 4-cycle systems of \(2K_v\)
- scientific article; zbMATH DE number 5778186
- Embeddings of resolvable 4-cycle systems
- \(\alpha\)-resolvable cycle systems for cycle length 4
- Almost resolvable 4-cycle systems
Cites work
- scientific article; zbMATH DE number 5556317 (Why is no real title available?)
- All 2-regular leaves of partial 6-cycle systems.
- All graphs with maximum degree three whose complements have 4-cycle decompositions
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Cycle decompositions of the line graph of \(K_ n\)
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Cycle systems of the line graph of the complete graph
- Decomposing complete equipartite graphs into short even cycles
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Decompositions of complete multipartite graphs into cycles of even length
- Four-cycle systems with two-regular leaves
- Hamilton cycle rich 2-factorizations of complete multipartite graphs
- Hamilton cycle rich two-factorizations of complete graphs
- Near 2-factorizations of \(2K_ n:\) Cycles of even length
- On the construction of odd cycle systems
- Quadratic leaves of maximal partial triple systems
Cited in
(4)
This page was built for publication: 4-cycle systems of \(K_n-E(F^\ast)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497370)
