The cyclic matching sequenceability of regular graphs

DOI10.1002/jgt.22701zbMath1522.05122arXiv1911.04055OpenAlexW3175121423MaRDI QIDQ6056787

Adam Mammoliti, Daniel Horsley

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

matchingchromatic indexedge orderingmatching sequenceability

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• The \(r\)-matching sequencibility of complete graphs
• Constructions via Hamiltonian theorems
• Cyclic Matching Sequencibility of Graphs
• Remarks on upper and lower bounds formatching sequencibility of graphs
• Probability Inequalities for Sums of Bounded Random Variables
• The Solution of a Timetabling Problem

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