Cyclic matching sequencibility of graphs

MaRDI QIDQ2906863zbMATH OpenFDO

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

Publication date 5 September 2012

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1109.6521, http://ajc.maths.uq.edu.au/pdf/53/ajc_v53_p245.pdf

zbMATH Keywords

matching numbermatching sequencibilitycyclic ordering of edges

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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}$ equal $m-1$.

Recommendations

• The cyclic matching sequenceability of regular graphs
• scientific article; zbMATH DE number 6423657
• The r-matching sequencibility of complete graphs
• Sequences of matchings in path-type graphs
• Cyclic separability in graphs
• scientific article; zbMATH DE number 1823784
• Matchings of cycles and paths in directed graphs
• Graphs with every matching contained in a cycle
• Perfect matching transitivity of circulant graphs
• Sequences, claws and cyclability of graphs

Cited in

(9)

• Combinatorial properties of integer matrices and integer matrices \(\mathrm{mod}\, k\)
• Permutations that separate close elements, and rectangle packings in the torus
• Permutations in which pairs of numbers are not simultaneously close in position and close in size
• The cyclic matching sequenceability of regular graphs
• The $r$-matching sequencibility of complete multi-$k$-partite $k$-graphs
• The r-matching sequencibility of complete graphs
• Permutations that separate close elements
• Sequences, claws and cyclability of graphs
• Remarks on upper and lower bounds for matching sequencibility of graphs

This page was built for publication: Cyclic matching sequencibility of graphs

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