Cyclic matching sequencibility of graphs

Authors

Richard A. Brualdi
Kathleen P. Kiernan
Seth A. Meyer
Michael W. Schroeder, Marshall UniversityFollow

Document Type

Article

Publication Date

6-2012

Abstract

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 equals m − 1.

Comments

Copyright © 2012 The Australasian Journal of Combinatorics. Reprinted with permission. All rights reserved.

The copy of record is available from the publisher at https://ajc.maths.uq.edu.au/pdf/53/ajc_v53_p245.pdf.

Recommended Citation

Brualdi RA, Kiernan KP, Meyer SA, Schroeder MW, Cyclic matching sequencibility of graphs. The Australasian Journal of Combinatorics 53 (2012), 245–256.