The cyclic matching sequenceability of regular graphs

DOI10.1002/JGT.22701MaRDI QIDQ6056787zbMATH OpenOpenAlexFDO

Authors Daniel Horsley, Adam Mammoliti

Publication date 4 October 2023

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1911.04055

zbMATH Keywords

chromatic indexedge orderingmatchingmatching sequenceability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: The cyclic matching sequenceability of a simple graph $G$, denoted $mathrmcms(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 $kgeq3$.

Recommendations

• Cyclic matching sequencibility of graphs
• The r-matching sequencibility of complete graphs
• Remarks on upper and lower bounds for matching sequencibility of graphs
• A note on cyclic connectivity and matching properties of regular graphs
• scientific article; zbMATH DE number 2151975

Cites work

• Constructions via Hamiltonian theorems
• Cyclic matching sequencibility of graphs
• scientific article; zbMATH DE number 6423657 (Why is no real title available?)
• Probability Inequalities for Sums of Bounded Random Variables
• Remarks on upper and lower bounds for matching sequencibility of graphs
• The r-matching sequencibility of complete graphs
• The Solution of a Timetabling Problem
• The wonderful Walecki construction

Cited in

(4)

• The r-matching sequencibility of complete graphs
• Cyclic matching sequencibility of graphs
• Remarks on upper and lower bounds for matching sequencibility of graphs
• A note on cyclic connectivity and matching properties of regular graphs

This page was built for publication: The cyclic matching sequenceability of regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6056787)