1633 search results - page 44 / 327 » Planar Map Graphs |
CORR
2007
Springer
13 years 9 months ago
2007
Springer
A k-frugal colouring of a graph G is a proper colouring of the vertices of G such that no colour appears more than k times in the neighbourhood of a vertex. This type of colouring...
GD
2004
Springer
14 years 2 months ago
2004
Springer
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2 )×O(n2 ) grid, with at most three bends per edge, where n is the number of verti...
IPL
2006
13 years 9 months ago
2006
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
ESA
1999
Springer
14 years 1 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
IPL
2002
13 years 8 months ago
2002
Given a planar point set, we wish to label the points with uniform circular labels such that each input point lies on the boundary of two labels, none of the interiors of the labe...