Skip to search formSkip to main contentSkip to account menu

Outerplanar graph

Known as: Outerplanarity 
In graph theory, an outerplanar graph is a graph that has a planar drawing for which all vertices belong to the outer face of the drawing… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Ply number is a recently developed graph drawing metric inspired by studying road networks. Informally, for each vertex v, which… 
2011
2011
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected… 
2010
2010
Vertex colorings of the square of an outerplanar graph have received a lot of attention recently. In this article we prove that… 
2006
2006
2004
2004
In this paper we show that an outerplanar graph G with maximum degree at most 3 has a 2-D orthogonal drawing with no bends if and… 
2004
2004
We provide lower and upper bounds for the domination numbers and the connected domination numbers for outerplanar graphs. We also… 
2003
2003
Given a connected weighted graph G = (V, E), we consider a hypergraph \(\mathcal{H}_G = (V,\mathcal{P}_G)\) corresponding to the… 
1997
1997
An outerplanar graph is a graph which can be embedded in the plane so that all vertices lie on the boundary of the exterior face…