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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1972-2017
0204019722017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A k-outerplanar graph is a graph that can be drawn in the plane without crossing such that after k-fold removal of the vertices… (More)
  • figure 1
  • figure 2
Is this relevant?
2012
2012
We consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
We show that the shortest-path metric of any k-outerplanar graph, for any fixed k, can be approximated by a probability… (More)
  • figure 3.1
  • figure 4.2
  • figure 4.3
  • figure 4.4
Is this relevant?
2002
2002
A proper vertex coloring of a graph is equitable if the sizes of color classes di2er by at most 1. In this note, we prove the… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This note proves that the game chromatic number of an outerplanar graph is at most 7. This improves the previous known upper… (More)
Is this relevant?
1996
1996
In this paper, we show that for outerplanar graphs G the problem of augmenting G by adding a minimum number of edges such that… (More)
  • figure 2
  • figure 8
Is this relevant?
Highly Cited
1992
Highly Cited
1992
A famous theorem of I. Fa`ry states that any planar graph can be drawn in the plane so that all edges are straight-line segments… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
We call a graph (m, k)-colorable if its vertices can be colored with m colors in such a way that each vertex is adjacent to at… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1979
Highly Cited
1979
One of the more important and often difficult problems in graph theoretic computing is that of recognizing whether an arbitrary… (More)
  • figure 1
Is this relevant?
1979
1979
The main purpose of this paper is to provide some further characterizations of outerplanar graphs. A graph G = (V, E) consists of… (More)
Is this relevant?