Small embeddings for partial 5-cycle systems
From MaRDI portal
Publication:2885148
Recommendations
Cites work
- scientific article; zbMATH DE number 4106905 (Why is no real title available?)
- 5-cycle systems with holes
- A Theorem on Coloring the Lines of a Network
- 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\)
- A partial m=(2k+1)-cycle system of order n can be embedded in an m- cycle of order (2n+1)m
- A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
- An asymptotic solution to the cycle decomposition problem for complete graphs
- Cycle decompositions of K_n and K_n-I
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
- Decompositions of complete graphs into long cycles
- Embedding partial 4-cycle systems of arbitrary index
- Embedding partial odd-cycle systems in systems with orders in all admissible congruence classes
- Embeddings of Steiner triple systems
- Embeddings of m-cycle systems and incomplete m-cycle systems: m 14
- Il primo amore non si scorda mai or an up-to-date survey of small embeddings for partial even-cycle systems
- On fans in multigraphs
- On the doyen‐wilson theorem for m‐cycle systems
- Packing cycles in complete graphs
- Packing paths in complete graphs
- Pancyclic graphs. I
- The Doyen-Wilson theorem extended to 5-cycles
- Tight embeddings of partial quadrilateral packings
Cited in
(5)
This page was built for publication: Small embeddings for partial 5-cycle systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2885148)
