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

Authors

John Caughman, Portland State UniversityFollow
John Krussel, Lewis & Clark College
James Mahoney, Portland State UniversityFollow

Published In

Graphs and Combinatorics

Document Type

Citation

Publication Date

3-1-2017

Abstract

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

Locate the Document

http://dx.doi.org/10.1007/s00373-017-1766-7

DOI

10.1007/s00373-017-1766-7

Persistent Identifier

https://archives.pdx.edu/ds/psu/25851

Citation Details

Caughman J., Krussel J., Mahoney J. 2017. Spanning Tree Decompositions of Complete Graphs Orthogonal to Rotational 1-Factorizations. Graphs and Cominatorics, 33(2):321-333.