643 search results - page 31 / 129 » Supereulerian planar graphs |
GD
1999
Springer
13 years 12 months ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
ARSCOM
2006
13 years 7 months ago
2006
MacGillivray and Seyffarth (J. Graph Theory 22 (1996), 213
JCT
2008
13 years 7 months ago
2008
Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these invest...
WADS
2001
Springer
14 years 2 days ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
RSA
2010
13 years 6 months ago
2010
We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size n satisfy a central limit theorem with mean and variance proport...