641 search results - page 57 / 129 » On Planar Quasi-Parity Graphs |
147
click to vote
DAM
2006
15 years 6 months ago
2006
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...
157
click to vote
GD
1998
Springer
15 years 10 months ago
1998
Springer
We describe a unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves. This framework includes several visual properties...
152
click to vote
EJC
2008
15 years 6 months ago
2008
Wang and Lih conjectured that for every g 5, there exists a number M(g) such that the square of a planar graph G of girth at least g and maximum degree M(g) is (+1)-colorable. ...
159
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T in the dual graph G such that T and T do not intersect. We show that it is not always poss...
166
click to vote
DM
2007
15 years 6 months ago
2007
In this paper it is shown that a class of almost-median graphs that includes all planar almost-median graphs can be recognized in O(m log n) time, where n denotes the number of ve...