Sciweavers

COMGEO
2012
ACM
12 years 7 months ago
Point-set embeddings of plane 3-trees
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...
Rahnuma Islam Nishat, Debajyoti Mondal, Md. Saidur...
JGT
2010
113views more  JGT 2010»
13 years 10 months ago
Coloring plane graphs with independent crossings
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...
Daniel Král', Ladislav Stacho
JGT
2010
89views more  JGT 2010»
13 years 10 months ago
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs
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...
Zdenek Dvorak, Daniel Král', Riste Skrekovs...
DM
2002
104views more  DM 2002»
13 years 11 months ago
A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph
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...
Brigitte Servatius, Herman Servatius
DAM
2002
76views more  DAM 2002»
13 years 11 months ago
Edge-pancyclicity of coupled graphs
The coupled graph c(G) of a plane graph G is the graph de
Ko-Wei Lih, Zengmin Song, Wei-Fan Wang, Kemin Zhan...
COMBINATORICS
2004
90views more  COMBINATORICS 2004»
13 years 11 months ago
Goldberg-Coxeter Construction for 3- and 4-valent Plane Graphs
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...
Mathieu Dutour, Michel Deza
JGAA
2008
100views more  JGAA 2008»
13 years 11 months ago
Convex Grid Drawings of Plane Graphs with Rectangular Contours
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...
Kazuyuki Miura, Akira Kamada, Takao Nishizeki
DAM
2008
92views more  DAM 2008»
13 years 11 months ago
Convex drawings of graphs with non-convex boundary constraints
: 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 ...
Seok-Hee Hong, Hiroshi Nagamochi
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 11 months ago
Schnyder decompositions for regular plane graphs and application to drawing
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...
Olivier Bernardi, Éric Fusy
GD
2008
Springer
14 years 15 days ago
Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights
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...
Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu