IEICET
2011
13 years 6 months ago
2011
In a rooted graph, a vertex is designated as its root. An outerplanar graph is represented by a plane embedding such that all vertices appear along its outer boundary. Two differ...
CPC
2006
13 years 11 months ago
2006
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
DAM
2010
13 years 11 months ago
2010
In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangles representa...
SODA
2004
ACM
14 years 26 days ago
2004
ACM
We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
CCCG
2007
14 years 28 days ago
2007
We show an algorithm for constructing O(dn log n) area outerplanar straight-line drawings of n-vertex outerplanar graphs with degree d. Also, we settle in the negative a conjectur...