Constructing edge-labellings of K_n with constant-length Hamilton cycles

MaRDI QIDQ3423972zbMATH OpenFDO

Authors Scott O. Jones, P. Mark Kayll

Publication date 15 February 2007

zbMATH Keywords

Hamiltonian cycletravelling salesman problemgraph labellingweak Sidon sequencewell-spread sequence

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Special sequences and polynomials (11B83) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Recommendations

• On constant-weight TSP-tours
• scientific article; zbMATH DE number 2148763
• scientific article; zbMATH DE number 2159648
• ALGORITHMS FOR LABELING CONSTANT WEIGHT GRAY CODES
• The 1-2-3 edge labeling and vertex coloring of complete graph \(K_N\) with a modified algorithm

Cited in

(3)

• On constant-weight TSP-tours
• scientific article; zbMATH DE number 2159648 (Why is no real title available?)
• The 1-2-3 edge labeling and vertex coloring of complete graph \(K_N\) with a modified algorithm

This page was built for publication: Constructing edge-labellings of \(K_n\) with constant-length Hamilton cycles

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