212 search results - page 9 / 43 » Subgraph Isomorphism in Planar Graphs and Related Problems |
149
click to vote
ALGOSENSORS
2004
Springer
15 years 9 months ago
2004
Springer
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
140
Voted
ALGORITHMICA
2006
15 years 4 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
118
Voted
ESA
2010
Springer
15 years 5 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 ...
139
click to vote
SWAT
1994
Springer
15 years 8 months ago
1994
Springer
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
115
click to vote
DM
2010
15 years 4 months ago
2010
We prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3 i j 7 is 3-colorable and pose some related problems on the 3-colorability of planar grap...