641 search results - page 49 / 129 » On Planar Quasi-Parity Graphs |
169
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
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...
150
click to vote
JGT
2008
15 years 6 months ago
2008
We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length.
169
click to vote
JCT
2006
15 years 6 months ago
2006
MacLane's planarity criterion states that a finite graph is planar if and only if its cycle space has a basis B such that every edge is contained in at most two members of B....
191
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize th...
185
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...