Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference8 articles.
1. Brualdi, R.A., Hollingsworth, S.: Multicolored trees in complete graphs. J. Combin. Theory Ser. B 68, 310–313 (1996)
2. London Math. Soc., Lecture Note Series;PJ Cameron,1976
3. Krussel, J., Marshall, S., Verrall, H.: Spanning trees orthogonal to 1-factorizations of $${K}_{2n}$$ K 2 n . ARS Comb. 57, 77–82 (2000)
4. Mazzuoccolo, G., Rinaldi, G.: $$k$$ k -pyramidal one-factorizations. Graphs Combin. 23, 315–326 (2007)
5. Mendelsohn, E., Rosa, A.: One-factorizations of the complete graph - a survey. J. Graph Theory 9, 43–65 (1985)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Quaternionic 1-Factorizations and Complete Sets of Rainbow Spanning Trees;Graphs and Combinatorics;2023-01-27
2. Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations;Discrete Mathematics;2019-04
3. Mixed hourglass graph;PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES AND TECHNOLOGY 2018 (MATHTECH2018): Innovative Technologies for Mathematics & Mathematics for Technological Innovation;2019