Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,468,400 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
1-planar graph
Angular resolution (graph drawing)
Apex graph
Baker's technique
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Low Ply Drawings of Trees and 2-Trees
M. Goodrich
,
Timothy Johnson
Canadian Conference on Computational Geometry
2018
Corpus ID: 51955638
Ply number is a recently developed graph drawing metric inspired by studying road networks. Informally, for each vertex v, which…
Expand
2011
2011
Farey graphs as models for complex networks
Zhongzhi Zhang
,
F. Comellas
Theoretical Computer Science
2011
Corpus ID: 17235012
2011
2011
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs
R. Laskar
,
H. M. Mulder
,
B. Novick
The Australasian Journal of Combinatorics
2011
Corpus ID: 1618226
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected…
Expand
2010
2010
Vertex coloring the square of outerplanar graphs of low degree
G. Agnarsson
,
M. Halldórsson
Discussiones Mathematicae Graph Theory
2010
Corpus ID: 1613956
Vertex colorings of the square of an outerplanar graph have received a lot of attention recently. In this article we prove that…
Expand
2006
2006
Short Labels by Traversal and Jumping
Nicolas Bonichon
,
C. Gavoille
,
Arnaud Labourel
Electron. Notes Discret. Math.
2006
Corpus ID: 300492
2004
2004
On the Orthogonal Drawing of Outerplanar Graphs
K. Nomura
,
Satoshi Tayu
,
S. Ueno
IEICE Transactions on Fundamentals of Electronics…
2004
Corpus ID: 31209144
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…
Expand
2004
2004
Dminating sets for outerplanar graphs
Val Pinciu
2004
Corpus ID: 115311919
We provide lower and upper bounds for the domination numbers and the connected domination numbers for outerplanar graphs. We also…
Expand
2003
2003
Enumerating Global Roundings of an Outerplanar Graph
Nadia Takki-Chebihi
,
T. Tokuyama
International Symposium on Algorithms and…
2003
Corpus ID: 38966197
Given a connected weighted graph G = (V, E), we consider a hypergraph \(\mathcal{H}_G = (V,\mathcal{P}_G)\) corresponding to the…
Expand
1997
1997
A Simple Near Optimal Parallel Algorithm for Recognizing Outerplanar Graphs
Shin-ichi Nakayama
,
Shigeru Masuyama
1997
Corpus ID: 55276704
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…
Expand
1996
1996
Ears of triangulations and Catalan numbers
F. Hurtado
,
M. Noy
Discrete Mathematics
1996
Corpus ID: 20704049
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE