Cyclic matching sequencibility of graphs
From MaRDI portal
Publication:2906863
zbMATH Open1256.05195arXiv1109.6521MaRDI QIDQ2906863FDOQ2906863
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)
Abstract: We define the cyclic matching sequencibility of a graph to be the largest integer such that there exists a cyclic ordering of its edges so that every consecutive edges in the cyclic ordering form a matching. We show that the cyclic matching sequencibility of and equal .
Full work available at URL: https://arxiv.org/abs/1109.6521
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
- 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
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (8)
- Title not available (Why is that?)
- Permutations that separate close elements, and rectangle packings in the torus
- Combinatorial properties of integer matrices and integer matrices modk
- 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
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)
