69 search results - page 3 / 14 » Coloring Vertices and Faces of Locally Planar Graphs |
COMGEO
2008
ACM
13 years 8 months ago
2008
ACM
Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that s...
CORR
2002
Springer
13 years 8 months ago
2002
Springer
Traditional representations of graphs and their duals suggest the requirement that the dual vertices should be placed inside their corresponding primal faces, and the edges of the ...
DAM
2010
13 years 8 months ago
2010
In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2...
TCS
2011
13 years 3 months ago
2011
ESA
2009
Springer
14 years 3 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...