202 search results - page 4 / 41 » On the Queue Number of Planar Graphs |
GD
1999
Springer
15 years 1 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 ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...
104
click to vote
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...
ENDM
2008
14 years 9 months ago
2008
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
GD
2006
Springer
15 years 1 months ago
2006
Springer