320 search results - page 12 / 64 » Parity Problems in Planar Graphs |
119
click to vote
FSTTCS
2005
Springer
15 years 6 months ago
2005
Springer
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
105
click to vote
JCT
2006
15 years 1 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....
113
click to vote
GD
2006
Springer
15 years 5 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...
ESA
2010
Springer
15 years 2 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
100
click to vote
WG
2007
Springer
15 years 7 months ago
2007
Springer
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...