On lower bounds for numbered complete graphs
From MaRDI portal
Publication:1293201
DOI10.1016/S0166-218X(99)00022-0zbMATH Open0940.90068MaRDI QIDQ1293201FDOQ1293201
Authors: Pierre Hansen, Brigitte Jaumard, Christophe Meyer 
Publication date: 25 July 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numbered complete graphs, unusual rulers, and assorted applications
- A survey: Recent results, conjectures, and open problems in labeling graphs
- On lower bounds for numbered complete graphs
- Title not available (Why is that?)
- Bounds and construction for difference triangle sets
- Lower bounds on multiple difference sets
- Bounds on the size of optimal difference triangle sets
- Title not available (Why is that?)
- Title not available (Why is that?)
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)
