On the sharpness of some results relating cuts and crossing numbers.
Beaudou, Laurent, Bokal, Drago (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “New upper bounds for the crossing number of on the Klein bottle”
On the sharpness of some results relating cuts and crossing numbers.
Crossing numbers and cutwidths.
Djidjev, Hristo N., Vrt'o, Imrich (2003)
Journal of Graph Algorithms and Applications
Similarity:
The Thickness of Amalgamations and Cartesian Product of Graphs
Yan Yang, Yichao Chen (2017)
Discussiones Mathematicae Graph Theory
Similarity:
The thickness of a graph is the minimum number of planar spanning subgraphs into which the graph can be decomposed. It is a measurement of the closeness to the planarity of a graph, and it also has important applications to VLSI design, but it has been known for only few graphs. We obtain the thickness of vertex-amalgamation and bar-amalgamation of graphs, the lower and upper bounds for the thickness of edge-amalgamation and 2-vertex-amalgamation of graphs, respectively. We also study...
New upper bounds on the order of cages.
Lazebnik, F., Ustimenko, V.A., Woldar, A.J. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Distinct distances in graph drawings.
Carmi, Paz, Dujmovic, Vida, Morin, Pat, Wood, David R. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bound graph polysemy.
Tanenbaum, Paul J. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Diagonalizable embedding of composition graphs
Mohammed Z. Abu-Sbeih (1999)
Mathematica Slovaca
Similarity:
Crossings, colorings, and cliques.
Albertson, Michael O., Cranston, Daniel W., Fox, Jacob (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: