115 search results - page 5 / 23 » Geometric graphs with no two parallel edges |
SPAA
2000
ACM
13 years 10 months ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...
ISAAC
2005
Springer
13 years 11 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
COMBINATORICS
2006
13 years 5 months ago
2006
It is proved that, if G is a K4-minor-free graph with maximum degree 3, then G is totally 4-choosable; that is, if every element (vertex or edge) of G is assigned a list of 4 colo...
ICDCS
2008
IEEE
14 years 6 days ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...