Cyclic Matching Sequencibility of Graphs
Combinatorics
2011-09-30 v1
Abstract
We define the cyclic matching sequencibility of a graph to be the largest integer such that there exists a cyclic ordering of its edges so that every consecutive edges in the cyclic ordering form a matching. We show that the cyclic matching sequencibility of and equal .
Keywords
Cite
@article{arxiv.1109.6521,
title = {Cyclic Matching Sequencibility of Graphs},
author = {Richard A. Brualdi and Kathleen P. Kiernan and Seth A. Meyer and Michael w. Schroeder},
journal= {arXiv preprint arXiv:1109.6521},
year = {2011}
}