Premium
The cyclic matching sequenceability of regular graphs
Author(s) -
Horsley Daniel,
Mammoliti Adam
Publication year - 2021
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.22701
Subject(s) - mathematics , combinatorics , matching (statistics) , indifference graph , graph , chordal graph , integer (computer science) , discrete mathematics , computer science , statistics , programming language
The cyclic matching sequenceability of a simple graph G , denoted 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 ⩾ 3 .