Abstract. We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial em...
Justin Cappos, Alejandro Estrella-Balderrama, J. J...
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...