Results 151 to 160 of about 969,499 (193)

Large induced subgraph with a given pathwidth in outerplanar graphs

arXiv.org
A long-standing conjecture by Albertson and Berman in 1979 states that every planar graph of order $n$ has an induced forest with at least $\lceil \frac{n}{2} \rceil$ vertices. As a variant of this conjecture, Chappell conjectured that every planar graph
Naoki Matsumoto, Takamasa Yashima
semanticscholar   +1 more source

Sombor index of maximal outerplanar graphs

Discrete Applied Mathematics
Hanyuan Deng, Zikai Tang
exaly   +2 more sources

Augmenting the Connectivity of Outerplanar Graphs

Algorithmica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alfredo García Olaverri, Ferran Hurtado, Marc Noy, Javier Tejel   +3 more
openaire   +2 more sources

Disjunctive domination in maximal outerplanar graphs

arXiv.org
A disjunctive dominating set of a graph $G$ is a set $D \subseteq V(G)$ such that every vertex in $V(G)\setminus D$ has a neighbor in $D$ or has at least two vertices in $D$ at distance $2$ from it.
Michael A. Henning, P. Maniya, D. Pradhan   +2 more
semanticscholar   +1 more source

On the Orthogonal Drawing of Outerplanar Graphs

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2004
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 only if G contains no triangles. We also show that an outerplanar graph G with maximum degree at most 6 has a 3-D orthogonal drawing with no bends if and only if G contains no triangles.
Kumiko Nomura, Satoshi Tayu, Shuichi Ueno   +2 more
openaire   +1 more source

Outerplanar graphs with positive Lin-Lu-Yau curvature

Journal of Combinatorics
In this paper, we show that all simple outerplanar graphs $G$ with minimum degree at least $2$ and positive Lin-Lu-Yau Ricci curvature on every edge have maximum degree at most $9$.
George Brooks, F. Osaye, Anna Schenfisch, Zhiyu Wang, Jinghao Yu   +4 more
semanticscholar   +1 more source

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

Odd 4-Coloring of Outerplanar Graphs

Graphs and Combinatorics
A proper k-coloring of G is called an odd coloring of G if for every vertex v, there is a color that appears at an odd number of neighbors of v. This concept was introduced recently by Petruševski and Škrekovski, and they conjectured that every planar ...
Masaki Kashima, Xuding Zhu
semanticscholar   +1 more source

A characterization of ?-outerplanar graphs

Journal of Graph Theory, 1996
Chartrand and Harary have shown that if G is a non-outerplanar graph such that, for every edge e, both the deletion G\e and the contraction G/e of e from G are outerplanar, then G is isomorphic to K4 or K2,3. An α-outerplanar graph is a graph which is not outerplanar such that, for some edge α, both G\α and G/α are outerplanar.
openaire   +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