641 search results - page 3 / 129 » On Planar Quasi-Parity Graphs |
WADS
2001
Springer
13 years 11 months ago
2001
Springer
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
GC
2002
Springer
13 years 6 months ago
2002
Springer
The main result of the papzer is that any planar graph with odd girth at least 10k
GD
2007
Springer
14 years 1 months ago
2007
Springer
Straight-line grid drawings of bounded size is a classical topic in graph drawing. The Graph Drawing Challenge 2006 dealt with minimizing the area of planar straight-line grid draw...
CORR
1999
Springer
13 years 6 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
WG
2004
Springer
14 years 10 days ago
2004
Springer
The family of well-orderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a well-orderly map. We show...