Can I read Cyclic Matching Sequencibility of Graphs on EtoBox?

Cyclic Matching Sequencibility of Graphs by Brualdi, Richard A.; Kiernan, Kathleen P.; Meyer, Seth A.; Schroeder, Michael w. is a scholarly article available to read on EtoBox.

What is Cyclic Matching Sequencibility of Graphs about?

We define the cyclic matching sequencibility of a graph to be the largest integer $d$ such that there exists a cyclic ordering of its edges so that every $d$ consecutive edges in the cyclic ordering form a matching. We show that the cyclic matching sequencibility of $K_{2m}$ and $K_{2m+1}$ equal $m-1$.

Author

Brualdi, Richard A.; Kiernan, Kathleen P.; Meyer, Seth A.; Schroeder, Michael w.

Published

2011

Language

EN