Results 161 to 170 of about 5,384 (188)

Drawing outerplanar minimum weight triangulations

Information Processing Letters, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
W. Lenhart, LIOTTA, Giuseppe
openaire   +2 more sources

Listing spanning trees of outerplanar graphs by pivot exchanges

Symposium on Theoretical Aspects of Computer Science
We prove that the spanning trees of any outerplanar triangulation $G$ can be listed so that any two consecutive spanning trees differ in an exchange of two edges that share an end vertex.
Nastaran Behrooznia, Torsten Mütze
semanticscholar   +1 more source

Secure Total Domination Number in Maximal Outerplanar Graphs

Discrete Applied Mathematics
A subset $S$ of vertices in a graph $G$ is a secure total dominating set of $G$ if $S$ is a total dominating set of $G$ and, for each vertex $u \not\in S$, there is a vertex $v \in S$ such that $uv$ is an edge and $(S \setminus \{v\}) \cup \{u\}$ is also
Yasufumi Aita, Toru Araki
semanticscholar   +1 more source

Entries of the bottleneck matrices of maximal outerplanar graphs

Linear and multilinear algebra
In this paper, we consider the entries of the bottleneck matrices of maximal outerplanar graphs. We recall patterns from [Kirkland SJ, Neumann M, Shader BL. Characteristic vertices of weighted trees via Perron values. Linear Multilinear Algebra.
Jason J. Molitierno
semanticscholar   +1 more source

Testing Outerplanarity of Bounded Degree Graphs

Algorithmica, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yoshida, Yuichi, Ito, Hiro
openaire   +1 more source

Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs

arXiv.org
In this paper, we study the following question. Let $\mathcal G$ be a family of planar graphs and let $k\geq 3$ be an integer. What is the largest value $f_k(n)$ such that every $n$-vertex graph in $\mathcal G$ has an induced subgraph with degree at most
Marco D'Elia, Fabrizio Frati
semanticscholar   +1 more source

Bottleneck matrices of maximal outerplanar graphs with isomorphic underlying trees

Linear and multilinear algebra
In this paper, we consider the entries of the bottleneck matrices of maximal outerplanar graphs with isomorphic underlying trees. We show how the entries of the bottleneck matrix are perturbed when we modify a maximal outerplanar graph into a ...
Jason J. Molitierno
semanticscholar   +1 more source

Outerplanar partial cubes

Reports@SCM
Partial cube-minors are an analogue of graph minors in partial cubes. We determine the set of forbidden partial cube minors of the classes of outerplanar and series-parallel partial cubes. This is the first result of this type for the partial cubes in a minor closed graph class.
Rovira Segú, Bernat, Knauer, Kolja
openaire   +1 more source

On list‐coloring outerplanar graphs

Journal of Graph Theory, 2008
AbstractWe prove that a 2‐connected, outerplanar bipartite graph (respectively, outerplanar near‐triangulation) with a list of colors L (v ) for each vertex v such that $|L(v)|\geq\min\{{\deg}(v),4\}$ (resp., $|L(v)|\geq{\min}\{{\deg}(v),5\}$) can be L‐list‐colored (except when the graph is K3 with identical 2‐lists).
openaire   +2 more sources

Embedding Outerplanar Graphs in Small Books

SIAM Journal on Algebraic Discrete Methods, 1987
A book consists of a number of half-planes (pages) sharing a common boundary line (the spine). A book embedding of a graph embeds the vertices on the spine and each edge in some page so that each page contains a plane subgraph. The width of a page is the maximum number of edges that intersect any half-line perpendicular to the spine in the page.
openaire   +1 more source