Results 91 to 100 of about 1,772 (132)

Interactive implementations of thermodynamics-based RNA structure and RNA-RNA interaction prediction approaches for example-driven teaching. [PDF]

PLoS Comput Biol, 2018
Raden M, Mohamed MM, Ali SM, Backofen R.
europepmc   +1 more source

Graph-distance distribution of the Boltzmann ensemble of RNA secondary structures. [PDF]

Algorithms Mol Biol, 2014
Qin J, Fricke M, Marz M, Stadler PF, Backofen R.   +4 more
europepmc   +1 more source

ACHROMATIC NUMBERS OF MAXIMAL OUTERPLANAR GRAPHS

ACHROMATIC NUMBERS OF MAXIMAL OUTERPLANAR GRAPHS
application/pdf A complete k-coloring of a graph ＄G＄ is a map from the vertices of ＄G＄ to ＄k＄ colors such that any two adjacent vertices get different colors and that any two different colors appear on the two endpoints of some edge. The achromatic number of ＄G＄ is the largest ＄k＄ such that ＄G＄ has a complete k-coloring.
openaire  

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

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

Some of the next articles are maybe not open access.

Related searches:

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