Labelling Hamiltonian cycles of the Johnson graph

MaRDI QIDQ2875905zbMATH OpenFDO

Authors George Barnes, Inessa Levi

Publication date 12 August 2014

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cyclelabelspartition

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Partitions of sets (05A18) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• ALGORITHMS FOR LABELING CONSTANT WEIGHT GRAY CODES
• Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups
• Distance-two labellings of Hamming graphs
• scientific article; zbMATH DE number 2192090
• Enumeration of labeled and unlabeled Hamiltonian cycles in complete k-partite graphs

This page was built for publication: Labelling Hamiltonian cycles of the Johnson graph

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