Small embeddings for partial 5-cycle systems (Q2885148)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Small embeddings for partial 5-cycle systems	scientific article

Statements

scholarly article

0 references

Small embeddings for partial 5-cycle systems (English)

0 references

Thomas A. McCourt

0 references

Geoffrey V. Martin

0 references

Journal of Combinatorial Designs

0 references

publication date

21 May 2012

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1002/jcd.20306

0 references

Cycle decompositions of \(K_n\) and \(K_n-I\)

0 references

Pancyclic graphs. I

0 references

Packing paths in complete graphs

0 references

Packing cycles in complete graphs

0 references

Decompositions of complete graphs into long cycles

0 references

A proof of Lindner's conjecture on embeddings of partial Steiner triple systems

0 references

An asymptotic solution to the cycle decomposition problem for complete graphs

0 references

Decompositions into 2-regular subgraphs and equitable partial cycle decompositions

0 references

5-cycle systems with holes

0 references

The Doyen-Wilson theorem extended to 5-cycles

0 references

On the doyen‐wilson theorem for m‐cycle systems

0 references

Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\)

0 references

On fans in multigraphs

0 references

Embeddings of Steiner triple systems

0 references

Tight embeddings of partial quadrilateral packings

0 references

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\)

0 references

Embedding partial odd-cycle systems in systems with orders in all admissible congruence classes

0 references

Il primo amore non si scorda mai or an up-to-date survey of small embeddings for partial even-cycle systems

0 references

A partial \(m=(2k+1)\)-cycle system of order \(n\) can be embedded in an \(m\)- cycle of order \((2n+1)m\)

0 references

0 references

Embedding partial 4-cycle systems of arbitrary index

0 references

Cycle decompositions III: Complete graphs and fixed length cycles

0 references

A Theorem on Coloring the Lines of a Network

0 references

Identifiers

zbMATH Open document ID

0 references

10.1002/jcd.20306

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2885148

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2885148&oldid=35280366"