Results 151 to 160 of about 3,997 (179)

The decycling number of outerplanar graphs

Journal of Combinatorial Optimization, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huilan Chang, Hung-Lin Fu, Min-Yun Lien
openaire   +2 more sources

The $$p-$$Arboricity of Outerplanar Graphs

Graphs and Combinatorics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mingyuan Ma, Han Ren
openaire   +1 more source

Multiterminal flows in outerplanar networks

Journal of Algorithms, 1983
Abstract An outerplanar network is an undirected network whose underlying graph is a triangulation of a polygon. We give a linear algorithm for finding maximum flow values between all pairs of nodes in the outerplanar network. Our algorithm constructs the cut-tree of the outerplanar network without using any maximum flow computation.
T. C. Hu, M. T. Shing
openaire   +2 more sources

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

Independent covers in outerplanar graphs

1988
A subset U of vertices of a plane graph is said to be a perfect face-independent vertex cover (FIVC) if and only if each face has exactly one vertex in U. Necessary and sufficient conditions for a maximal plane graph to have a perfect FIVC are derived.
Maciej M. Syslo, Pawel Winter
openaire   +1 more source

Proximity Drawings of Outerplanar Graphs.

1997
A proximity drawing of a graph is one in which pairs of adjacent vertices are drawn relatively close together according to some proximity measure while pairs of non-adjacent vertices are drawn relatively far apart. The fundamental question concerning proximity drawability is: Given a graph G and a definition of proximity, is it possible to construct a ...
W. Lenhart, LIOTTA, Giuseppe
openaire   +2 more sources

Generalized outerplanar Turán number of short paths

Discrete Mathematics, 2023
Ervin Gyori, Chuanqi Xiao
exaly  

A note on domination number in maximal outerplanar graphs

Discrete Applied Mathematics, 2021
Chanjuan Liu
exaly  

Outerplanar Turán numbers of cycles and paths

Discrete Mathematics, 2023
Mingqing Zhai
exaly  

Game chromatic number of outerplanar graphs

Journal of Graph Theory, 1999
D J Guan, Xuding Zhu
exaly