Sciweavers

COMPGEOM
2008
ACM
13 years 6 months ago
Polychromatic colorings of plane graphs
We show that the vertices of any plane graph in which every face is of length at least g can be colored by (3g - 5)/4 colors so that every color appears in every face. This is nea...
Noga Alon, Robert Berke, Kevin Buchin, Maike Buchi...
GD
2001
Springer
13 years 8 months ago
Orthogonal Drawings of Plane Graphs without Bends
In an orthogonal drawing of a plane graph each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A bend is a point at which...
Md. Saidur Rahman, Mahmuda Naznin, Takao Nishizeki
ISAAC
2004
Springer
98views Algorithms» more  ISAAC 2004»
13 years 9 months ago
Inner Rectangular Drawings of Plane Graphs
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner ...
Kazuyuki Miura, Hiroki Haga, Takao Nishizeki