On lower bounds for numbered complete graphs

DOI10.1016/S0166-218X(99)00022-0MaRDI QIDQ1293201zbMATH OpenFDO

Authors 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)

Recommendations

• On the number of 1-factorizations of a complete graph
• Safe lower bounds for graph coloring
• A solution to an open problem on lower against number in graphs
• Lower bounds for combinatorial problems on graphs
• Edge colorings of the complete graph \(K _{149}\) and the lower bounds of three Ramsey numbers

Cites work

• scientific article; zbMATH DE number 3853101 (Why is no real title available?)
• scientific article; zbMATH DE number 3698968 (Why is no real title available?)
• scientific article; zbMATH DE number 3783030 (Why is no real title available?)
• scientific article; zbMATH DE number 3458691 (Why is no real title available?)
• scientific article; zbMATH DE number 3482359 (Why is no real title available?)
• scientific article; zbMATH DE number 3345494 (Why is no real title available?)
• A survey: Recent results, conjectures, and open problems in labeling graphs
• Bounds and construction for difference triangle sets
• Bounds on the size of optimal difference triangle sets
• Lower bounds on multiple difference sets
• Numbered complete graphs, unusual rulers, and assorted applications
• On lower bounds for numbered complete graphs

Cited in

(11)

• A tabu search algorithm for difference triangle sets and Golomb rulers
• A solution to an open problem on lower against number in graphs
• The upper bound on the Eulerian recurrent lengths of complete graphs obtained by an IP solver
• A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs
• Optimal Numberings of an $N \times N$ Array
• On lower bounds for numbered complete graphs
• A lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph
• scientific article; zbMATH DE number 894698 (Why is no real title available?)
• scientific article; zbMATH DE number 4055659 (Why is no real title available?)
• Note on strict-double-bound numbers of nearly complete graphs missing some edges
• Equivalence of some LP-based lower bounds for the Golomb ruler problem

This page was built for publication: On lower bounds for numbered complete graphs

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