Geometric thickness of complete graphs.
Dillencourt, Michael B., Eppstein, David, Hirschberg, Daniel S. (2000)
Journal of Graph Algorithms and Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Outerplanar crossing numbers, the circular arrangement problem and isoperimetric functions.”
Geometric thickness of complete graphs.
New lower bounds for orthogonal drawings.
Biedl, Therese C. (1998)
Journal of Graph Algorithms and Applications
Similarity:
Edit distance and its computation.
Balogh, József, Martin, Ryan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The evolution of uniform random planar graphs.
Dowden, Chris (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Drawing a graph in a hypercube.
Wood, David R. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the number of planar orientations with prescribed degrees.
Felsner, Stefan, Zickfeld, Florian (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Perfect matchings for the three-term Gale-Robinson sequences.
Bousquet-Mélou, Mireille, Propp, James, West, Julian (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Parameters of bar -visibility graphs.
Felsner, Stefan, Massow, Mareike (2008)
Journal of Graph Algorithms and Applications
Similarity:
Bounds for orthogonal 3-D graph drawing.
Biedl, T., Shermer, T., Whitesides, S., Wismath, S. (1999)
Journal of Graph Algorithms and Applications
Similarity:
On multicolor Ramsey number of paths versus cycles.
Omidi, Gholam Reza, Raeisi, Ghaffar (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lower bounds for the number of bends in three-dimensional orthogonal graph drawings.
Wood, David R. (2003)
Journal of Graph Algorithms and Applications
Similarity:
Constrainted graph processes.
Bolobás, Béla, Riordan, Oliver (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the resilience of long cycles in random graphs.
Dellamonica, Domingos jun., Kohayakawa, Yoshiharu, Marciniszyn, Martin, Steger, Angelika (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: