Ningbo University
Department of Mathematics, Ningbo University, 315211, Ningbo, China
Soochow University
Department of Mathematics, Soochow University, 215006, Suzhou, China
https://scigraph.springernature.com/explorer/license/
2019-03
en
false
373-392
https://link.springer.com/10.1007%2Fs00373-018-2000-y
Two Orthogonal 4-Cycle-Free One-Factorizations of Complete Graphs
2019-03-01
A pair of orthogonal one-factorizations F and G of the complete graph Kn is C4-free if for any two factors F∈F and G∈G the union F∪G does not include a cycle of length four. Such a concept was introduced by Blokhuis et al. (J Combin Theory B 82: 1–18, 2001), who used it to improve the upper bound for two-round rainbow colorings of Kn. In this paper, we focus on constructions for a pair of orthogonal C4-free one-factorizations of the complete graph Kn. Some infinite classes of such orthogonal decompositions are obtained.
2019-04-11T09:08
articles
research_article
Ji
Lijun
Jingjun
Bao
Pure Mathematics
Springer Nature - SN SciGraph project
3f5c3a981e4dd09d406711b1704ea1a16c480ce4a0eb6fb660569d47de14fc08
readcube_id
10.1007/s00373-018-2000-y
doi
0911-0119
1435-5914
Graphs and Combinatorics
dimensions_id
pub.1111057361
35
2
Mathematical Sciences