Results 71 to 80 of about 119 (107)

Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. [PDF]

Discrete Comput Geom
Aichholzer O, García A, Tejel J, Vogtenhuber B, Weinberger A.   +4 more
europepmc   +1 more source

Leveraging graphical model techniques to study evolution on phylogenetic networks. [PDF]

Philos Trans R Soc Lond B Biol Sci
Teo B, Bastide P, Ané C.
europepmc   +1 more source

Structure and properties of maximal outerplanar graphs.

, 2015
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Isolation number of maximal outerplanar graphs

Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tokunaga, Shin-ichi, Jiarasuksakun, Thiradet, Kaemawichanurat, Pawaton   +2 more
openaire   +4 more sources

Linear algorithms to recognize outerplanar and maximal outerplanar graphs

Information Processing Letters, 1979
openaire   +4 more sources

Total Dominating Sets in Maximal Outerplanar Graphs [PDF]

Graphs and Combinatorics, 2017
A set \(D\subseteq V(G)\) is a total domination set of graph \(G\) if every vertex from \(V(G)\) has a neighbor in \(D\). The minimum cardinality of a total domination set of \(G\) is called total domination number and is denoted by \(\gamma_t(G)\). A recent result from \textit{M. Dorfling} et al. [Discrete Math. 339, No.
Lemańska, Magdalena, Zuazua, Rita, Żyliński, Paweł   +2 more
openaire   +2 more sources

Oriented diameter of maximal outerplanar graphs

Journal of Graph Theory, 2021
AbstractLet be a finite connected undirected graph and a strong orientation of . The diameter of , denoted by , is the maximum directed distance between any two vertices of . The oriented diameter of is defined as In this paper, we show that for any maximal outerplanar graph of order , with four exceptions, and the upper bound is sharp.
Xiaolin Wang, Yaojun Chen, Peter Dankelmann, Yubao Guo, Michel Surmacs, Lutz Volkmann   +5 more
openaire   +2 more sources

Semipaired domination in maximal outerplanar graphs

Journal of Combinatorial Optimization, 2019
Let $G$ be a graph with vertex set $V(G)$. A set $D \subseteq V(G)$ is a dominating set of $G$ if each vertex not in $D$ is adjacent to a vertex in $D$ of $G$. If $G$ has no isolated vertex, then a dominating set $S$ of $G$ is called a semi-paired dominating set of $G$ if every vertex in $S$ is paired with exactly one other vertex in $S$ that is within
Henning, Michael A., Kaemawichanurat, Pawaton   +1 more
openaire   +1 more source