On the cutting edge: simplified planarity by edge addition.
Boyer, John M., Myrvold, Wendy J. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “Improved lower bounds on the approximability of the traveling salesman problem”
On the cutting edge: simplified planarity by edge addition.
Embedding vertices at points: Few bends suffice for planar graphs.
Kaufmann, Michael, Wiese, Roland (2002)
Journal of Graph Algorithms and Applications
Similarity:
-colored point-set embeddability of outerplanar graphs.
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk, Trotta, Francesco, Wismath, Stephen K. (2008)
Journal of Graph Algorithms and Applications
Similarity:
An upper bound for the shortest hamiltonian path in the symmetric euclidean case
Ioan Tomescu (1983)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The rectilinear crossing number of is 62.
Brodsky, Alex, Durocher, Stephane, Gethner, Ellen (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Morphing planar graph drawings with bent edges.
Lubiw, Anna, Petrick, Mark (2011)
Journal of Graph Algorithms and Applications
Similarity:
On Eggleton and Guy’s conjectured upper bound for the crossing number of the -cube
Luerbio Faria, Celina Miraglia Herrera de Figueiredo (2000)
Mathematica Slovaca
Similarity:
Counting triangulations of planar point sets.
Sharir, Micha, Sheffer, Adam (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hypergraphs with large transversal number and with edge sizes at least four
Michael Henning, Christian Löwenstein (2012)
Open Mathematics
Similarity:
Let H be a hypergraph on n vertices and m edges with all edges of size at least four. The transversal number τ(H) of H is the minimum number of vertices that intersect every edge. Lai and Chang [An upper bound for the transversal numbers of 4-uniform hypergraphs, J. Combin. Theory Ser. B, 1990, 50(1), 129–133] proved that τ(H) ≤ 2(n+m)/9, while Chvátal and McDiarmid [Small transversals in hypergraphs, Combinatorica, 1992, 12(1), 19–26] proved that τ(H) ≤ (n + 2m)/6. In this paper, we...