39 search results - page 6 / 8 » Adjacency posets of planar graphs |
73
Voted
WG
2007
Springer
15 years 5 months ago
2007
Springer
For a 3-colourable graph G, the 3-colour graph of G, denoted C3(G), is the graph with node set the proper vertex 3-colourings of G, and two nodes adjacent whenever the correspondi...
91
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...
115
click to vote
CCCG
2009
15 years 24 days ago
2009
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
ISSAC
2007
Springer
15 years 5 months ago
2007
Springer
An algorithm is presented for the geometric analysis of an algebraic curve f(x, y) = 0 in the real affine plane. It computes a cylindrical algebraic decomposition (CAD) of the pla...
MOBICOM
2006
ACM
15 years 5 months ago
2006
ACM
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...