Given a finite, undirected, simple graph G, we are concerned with operations on G that
transform it into a planar graph. We give a survey of results about such operations and …

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 …

Recently the hypercube-like networks have received considerable attention in the field of
parallel computing due to its high potential for system availability and parallel execution of …

We prove that the minimal VLSI layout of the arrangement graph A (n, k) occupies Θ (n!/(nk-
1)!) 2 area. As a special case we obtain an optimal layout for the star graph S n with the area …

The paper introduces the book crossing number problem which can be viewed as a variant
of the well-known plane and surface crossing number problem or as a generalization of the …

We give drawings of a complete graph K n with O (n 4 log 2 g/g) many crossings on an
orientable or nonorientable surface of genus g≥ 2. We use these drawings of K n and give a …

We give a survey of recent techniques for deriving lower bounds and algorithms for
constructing upper bounds for several variations of the crossing number problem. Our aim is …

We introduce a general framework to estimate the crossing number of a graph on a compact
2-manifold in terms of the crossing number of the complete graph of the same size on the …

We define and efficiently compute the canonical flow on a graph, which is a certain feasible
solution for the concurrent flow problem and exhibits invariance under the action of the …

We study the integral uniform (multicommodity) flow problem in a graph G and construct a
fractional solution whose properties are invariant under the action of a group of …