Back to Search
Start Over
The cyclic matching sequenceability of regular graphs
- Publication Year :
- 2019
-
Abstract
- The cyclic matching sequenceability of a simple graph $G$, denoted $\mathrm{cms}(G)$, is the largest integer $s$ for which there exists a cyclic ordering of the edges of $G$ so that every set of $s$ consecutive edges forms a matching. In this paper we consider the minimum cyclic matching sequenceability of $k$-regular graphs. We completely determine this for $2$-regular graphs, and give bounds for $k \geq 3$.<br />Comment: 24 pages, 1 figure
- Subjects :
- Mathematics - Combinatorics
05C70
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1911.04055
- Document Type :
- Working Paper