Embedding partial \(G\)-designs where \(G\) is a 4-cycle with a pendant edge
From MaRDI portal
Publication:1773359
DOI10.1016/J.DISC.2004.11.005zbMath1059.05029OpenAlexW2046662775MaRDI QIDQ1773359
Publication date: 28 April 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.11.005
Related Items (2)
Completing partial packings of bipartite graphs ⋮ Tight embeddings of partial quadrilateral packings
Cites Work
- A partial \(m=(2k+1)\)-cycle system of order \(n\) can be embedded in an \(m\)- cycle of order \((2n+1)m\)
- Another class of balanced graph designs: Balanced circuit designs
- Embeddings of partial Steiner triple systems
- 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\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Embedding partial \(G\)-designs where \(G\) is a 4-cycle with a pendant edge
