On the flip graphs on perfect matchings of complete graphs and signed reversal graphs
Combinatorics
2021-10-20 v3 Discrete Mathematics
Abstract
In this paper, we study the flip graph on the perfect matchings of a complete graph of even order. We investigate its combinatorial and spectral properties including connections to the signed reversal graph and we improve a previous upper bound on its chromatic number.
Keywords
Cite
@article{arxiv.2006.12994,
title = {On the flip graphs on perfect matchings of complete graphs and signed reversal graphs},
author = {Sebastian M. Cioabă and Gordon Royle and Zhao Kuang Tan},
journal= {arXiv preprint arXiv:2006.12994},
year = {2021}
}
Comments
15 pages, 6 figures, 2 tables