Crossing numbers of Sierpiński graphs S (n, k) and their regularizations S+ (n, k) and S++
(n, k) are studied. Drawings of these graphs are presented and proved to be optimal for S+ …

62] Turan, P., A note of welcome, J. Graph Theory 1 (1977) 7-9. 63] Dambitis, J., An
algorithm for superimposing a nonplanar graph onto the plane with nearly minimal number …

The planarization method is the most successful practical approach for minimizing the
number of crossings in a drawing of a graph and, when used as the first step of the topology …

A tile T is a connected graph together with two specified sequences of vertices, the left and
right walls. The crossing number tcr (T) of a tile T is the minimum number of crossings …

The graph theoretic problem of crossing numbers has been around for over 60 years, but
still very little is known about this simple, yet intricate nonplanarity measure. The question is …

The crossing number is the smallest number of pairwise edge crossings when drawing a
graph into the plane. There are only very few graph classes for which the exact crossing …

It is known that the problem of computing the edge dimension of a graph is NP-hard, and
that the edge dimension of any generalized Petersen graph P (n, k) is at least 3. We prove …

The planarization method is the strongest known method to heuristically find good solutions
to the general crossing number problem in graphs: starting from a planar subgraph, one …

Bhatt and Leighton proved that the crossing number of a network (graph) is closely related to
the minimum layout area required for the implementation of a VLSI circuit for that network …

The generalized Petersen graph P (n, k) is an undirected graph on 2n vertices with V (P (n,
k))={ai, bi: 0≤ i≤ n− 1} and E (P (n, k))={aibi, aiai+ 1, bibi+ k: 0≤ i≤ n− 1, subscripts modulo …