Small embeddings for partial 5-cycle systems

DOI10.1002/JCD.20306zbMATH Open1238.05044OpenAlexW2075162736MaRDI QIDQ2885148FDOQ2885148

Authors: Thomas A. McCourt, Geoffrey 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

Recommendations

• scientific article; zbMATH DE number 1744088
• Il primo amore non si scorda mai or an up-to-date survey of small embeddings for partial even-cycle systems
• scientific article; zbMATH DE number 1076133
• scientific article; zbMATH DE number 4106905
• scientific article; zbMATH DE number 1066163

Mathematics Subject Classification ID

Other designs, configurations (05B30) Graph designs and isomorphic decomposition (05C51)

Cites Work

• Pancyclic graphs. I
• Il primo amore non si scorda mai or an up-to-date survey of small embeddings for partial even-cycle systems
• A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
• Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• Packing paths in complete graphs
• Packing cycles in complete graphs
• A Theorem on Coloring the Lines of a Network
• Embedding partial 4-cycle systems of arbitrary index
• Embeddings of 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\)
• Tight embeddings of partial quadrilateral packings
• The Doyen-Wilson theorem extended to 5-cycles
• Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\)
• On the doyen‐wilson theorem for m‐cycle systems
• 5-cycle systems with holes
• An asymptotic solution to the cycle decomposition problem for complete graphs
• Decompositions of complete graphs into long cycles
• A partial \(m=(2k+1)\)-cycle system of order \(n\) can be embedded in an \(m\)- cycle of order \((2n+1)m\)
• On fans in multigraphs
• Title not available (Why is that?)
• Embedding partial odd-cycle systems in systems with orders in all admissible congruence classes

Cited In (5)

• The Doyen-Wilson theorem extended to 5-cycles
• Title not available (Why is that?)
• Embedding 5-cycle systems into pentagon triple systems
• A small embedding for partial even-cycle systems
• Embedding partial 4-cycle systems of arbitrary index

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)