Document Type

Article

Publication Date

2020

Department

Department of Mathematical Sciences

Abstract

If X is a connected graph, then an X-factor of a larger graph is a spanning subgraph in which all of its components are isomorphic to X. A uniformly resolvable {X, Y }-decomposition of the complete graph Kv is an edge decomposition of Kv into exactly r X-factors and s Y -factors. In this article we determine necessary and sufficient conditions for when the complete graph Kv has a uniformly resolvable decompositions into 1-factors and K1,4-factors.

Publisher's Statement

© The author(s). Released under the CC BY 4.0 International License. Publisher’s version of record: https://ajc.maths.uq.edu.au/pdf/76/ajc_v76_p055.pdf

Publication Title

AUSTRALASIAN JOURNAL OF COMBINATORICS

Creative Commons License

Creative Commons Attribution 4.0 License
This work is licensed under a Creative Commons Attribution 4.0 License.

Version

Publisher's PDF

Included in

Mathematics Commons

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.