4-cycle systems of K_n-E(F^)
From MaRDI portal
Publication:497370
DOI10.1007/S00373-014-1433-1zbMATH Open1322.05080OpenAlexW202516987MaRDI QIDQ497370FDOQ497370
Authors: Nidhi Sehgal, C. A. Rodger 
Publication date: 24 September 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1433-1
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
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Near 2-factorizations of \(2K_ n:\) Cycles of even length
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Quadratic leaves of maximal partial triple systems
- Decompositions of complete multipartite graphs into cycles of even length
- Decomposing complete equipartite graphs into short even cycles
- Cycle decompositions of the line graph of \(K_ n\)
- Hamilton cycle rich 2-factorizations of complete multipartite graphs
- On the construction of odd cycle systems
- Title not available (Why is that?)
- Hamilton cycle rich two-factorizations of complete graphs
- Cycle systems of the line graph of the complete graph
- All 2-regular leaves of partial 6-cycle systems.
- Four-cycle systems with two-regular leaves
- All graphs with maximum degree three whose complements have 4-cycle decompositions
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)
