Join Our Newsletter

COMGEO

2012

ACM

11 years 1 months ago
2012

ACM

A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...

JGT

2010

12 years 4 months ago
2010

We show that every plane graph with maximum face size four whose all faces of size four are vertex-disjoint is cyclically 5-colorable. This answers a question of Albertson whether...

JGT

2010

12 years 4 months ago
2010

We study vertex-colorings of plane graphs that do not contain a rainbow face, i.e., a face with vertices of mutually distinct colors. If G is a 3-connected plane graph with n vert...

DM

2002

12 years 5 months ago
2002

A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...

DAM

2002

12 years 5 months ago
2002

The coupled graph c(G) of a plane graph G is the graph de

COMBINATORICS

2004

12 years 5 months ago
2004

We consider the Goldberg-Coxeter construction GCk,l(G0) (a generalization of a simplicial subdivision of the dodecahedron considered in [Gold37] and [Cox71]), which produces a pla...

JGAA

2008

12 years 6 months ago
2008

In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and all facial cycles are drawn as convex polygons. In a convex gr...

DAM

2008

12 years 6 months ago
2008

: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...

CORR

2010

Springer

12 years 6 months ago
2010

Springer

Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...

GD

2008

Springer

12 years 7 months ago
2008

Springer

A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...