The \(r\)-matching sequencibility of complete graphs

zbMath1378.05148arXiv1711.05013MaRDI QIDQ1691100

Adam Mammoliti

Publication date: 15 January 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

graphhypergraphmatchinggraph decompositionedge orderingmatching sequencibility

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

The cyclic matching sequenceability of regular graphs ⋮ Unnamed Item ⋮ The $r$-matching sequencibility of complete multi-$k$-partite $k$-graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• Decompositions of complete uniform hypergraphs into Hamilton Berge cycles
• Constructions via Hamiltonian theorems
• Cyclic Matching Sequencibility of Graphs

This page was built for publication: The \(r\)-matching sequencibility of complete graphs