Small embeddings for partial 5-cycle systems
From MaRDI portal
Publication:2885148
DOI10.1002/jcd.20306zbMath1238.05044OpenAlexW2075162736MaRDI QIDQ2885148
Thomas A. McCourt, Geoffrey V. Martin
Publication date: 21 May 2012
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20306
Cites Work
- Unnamed Item
- 5-cycle systems with holes
- A partial \(m=(2k+1)\)-cycle system of order \(n\) can be embedded in an \(m\)- cycle of order \((2n+1)m\)
- Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
- Packing cycles in complete graphs
- Tight embeddings of partial quadrilateral packings
- Packing paths in complete graphs
- Embedding partial 4-cycle systems of arbitrary index
- The Doyen-Wilson theorem extended to 5-cycles
- Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\)
- Il primo amore non si scorda mai or an up-to-date survey of small embeddings for partial even-cycle systems
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- A partial \(2k\)-cycle system of order \(n\) can be embedded in a \(2k\)-cycle system of order \(kn+c(k),k\geqslant 3\), where \(c(k)\) is a quadratic function of \(k\)
- An asymptotic solution to the cycle decomposition problem for complete graphs
- Pancyclic graphs. I
- Embeddings of Steiner triple systems
- Cycle decompositions III: Complete graphs and fixed length cycles
- Embedding partial odd-cycle systems in systems with orders in all admissible congruence classes
- A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
- Decompositions of complete graphs into long cycles
- On the doyen‐wilson theorem for m‐cycle systems
- On fans in multigraphs
- A Theorem on Coloring the Lines of a Network
This page was built for publication: Small embeddings for partial 5-cycle systems
