Remarks on upper and lower bounds formatching sequencibility of graphs

DOI10.2298/FIL1608091CzbMath1462.05293MaRDI QIDQ5279493

Shuya Chiba, Yuji Nakano

Publication date: 19 July 2017

Published in: Filomat (Search for Journal in Brave)

zbMATH Keywords

matching numbermatchingsmatching sequencibility$k$th power of a Hamilton path

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

The cyclic matching sequenceability of regular graphs

This page was built for publication: Remarks on upper and lower bounds formatching sequencibility of graphs