Enclosings of decompositions of complete multigraphs in 2‐factorizations

Enclosings of decompositions of complete multigraphs in 2‐factorizations Let k, m, n, λ, and μ be positive integers. A decomposition of λKn into edge‐disjoint subgraphs G1,…,Gk is said to be enclosed by a decomposition of μKm into edge‐disjoint subgraphs H1,…,Hk if μ>λ and, after a suitable labeling of the vertices in both graphs, λKn is a subgraph of μKm and Gi is a subgraph of Hi for all i=1,⋯,k. In this paper, we continue the study of enclosings of given decompositions by decompositions that consist of spanning subgraphs. A decomposition of a graph is a 2‐factorization if each subgraph is 2‐regular and spanning, and is Hamiltonian if each subgraph is a Hamiltonian cycle. We give necessary and sufficient conditions for the existence of a 2‐factorization of μKn+m that encloses a given decomposition of λKn whenever μ>λ and m≥n−2. We also give necessary and sufficient conditions for the existence of a Hamiltonian decomposition of μKn+m that encloses a given decomposition of λKn whenever μ>λ and either m≥n−1 or n=3 and m=1, or μ=2, λ=1, and m=n−2. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Combinatorial Designs Wiley

Enclosings of decompositions of complete multigraphs in 2‐factorizations

Loading next page...
 
/lp/wiley/enclosings-of-decompositions-of-complete-multigraphs-in-2-UsTNEpL6RL
Publisher
Wiley
Copyright
Copyright © 2018 Wiley Periodicals, Inc.
ISSN
1063-8539
eISSN
1520-6610
D.O.I.
10.1002/jcd.21601
Publisher site
See Article on Publisher Site

Abstract

Let k, m, n, λ, and μ be positive integers. A decomposition of λKn into edge‐disjoint subgraphs G1,…,Gk is said to be enclosed by a decomposition of μKm into edge‐disjoint subgraphs H1,…,Hk if μ>λ and, after a suitable labeling of the vertices in both graphs, λKn is a subgraph of μKm and Gi is a subgraph of Hi for all i=1,⋯,k. In this paper, we continue the study of enclosings of given decompositions by decompositions that consist of spanning subgraphs. A decomposition of a graph is a 2‐factorization if each subgraph is 2‐regular and spanning, and is Hamiltonian if each subgraph is a Hamiltonian cycle. We give necessary and sufficient conditions for the existence of a 2‐factorization of μKn+m that encloses a given decomposition of λKn whenever μ>λ and m≥n−2. We also give necessary and sufficient conditions for the existence of a Hamiltonian decomposition of μKn+m that encloses a given decomposition of λKn whenever μ>λ and either m≥n−1 or n=3 and m=1, or μ=2, λ=1, and m=n−2.

Journal

Journal of Combinatorial DesignsWiley

Published: Jan 1, 2018

Keywords: ; ;

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off