On the embedding of partial three path designs

DOI10.1016/J.DISC.2015.12.012zbMath1333.05209OpenAlexW2234140718MaRDI QIDQ271611

C. A. Rodger, T. R. III Whitt

Publication date: 7 April 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.12.012

zbMATH Keywords

graph embeddingsmaximal path embeddingspartial graph designs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph designs and isomorphic decomposition (05C51)

Cites Work

• Unnamed Item
• Unnamed Item
• The embedding of partial triple systems when 4 divides \(\lambda\)
• A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3
• Il primo amore non si scorda mai or an up-to-date survey of small embeddings for partial even-cycle systems
• Embeddings of partial Steiner triple systems
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Small embeddings for partial cycle systems of odd length
• A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
• Embedding Partial Steiner Triple Systems

This page was built for publication: On the embedding of partial three path designs