4.2 Article

Spanning Tree Decompositions of Complete Graphs Orthogonal to Rotational 1-Factorizations

期刊

GRAPHS AND COMBINATORICS
卷 33, 期 2, 页码 321-333

出版社

SPRINGER JAPAN KK
DOI: 10.1007/s00373-017-1766-7

关键词

Spanning tree; 1-factorization; Complete graph; Matching

向作者/读者索取更多资源

In Krussel et al. (ARS Comb 57:77-82, 2000), Krussel, Marshall, and Verall proved that whenever is a prime of the form , there exists a spanning tree decomposition of orthogonal to the 1-factorization . In this paper, we develop a technique for constructing spanning tree decompositions that are orthogonal to rotational 1-factorizations of . We apply our results to show that, for every , there exists a spanning tree decomposition orthogonal to . We include similar applications to other rotational families of 1-factorizations, and provide directions for further research.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.2
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据