On lower bounds for numbered complete graphs

DOI10.1016/S0166-218X(99)00022-0zbMath0940.90068MaRDI QIDQ1293201

Pierre Hansen, Brigitte Jaumard, Christophe Meyer

Publication date: 25 July 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Operations research and management science (90B99)

Related Items

On lower bounds for numbered complete graphs, A tabu search algorithm for difference triangle sets and Golomb rulers, Equivalence of some LP-based lower bounds for the Golomb ruler problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds on multiple difference sets
• On lower bounds for numbered complete graphs
• Bounds on the size of optimal difference triangle sets
• Numbered complete graphs, unusual rulers, and assorted applications
• A survey: Recent results, conjectures, and open problems in labeling graphs
• Bounds and construction for difference triangle sets