Results 141 to 150 of about 211 (163)
Some of the next articles are maybe not open access.
Independent covers in outerplanar graphs
1988A 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.
1997A 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
Centers of maximal outerplanar graphs
Journal of Graph Theory, 1980AbstractThe center of a graph is defined to be the subgraph induced by the set of vertices that have minimum eccentricities (i.e., minimum distance to the most distant vertices). It is shown that only seven graphs can be centers of maximal outerplanar graphs.
openaire +2 more sources
A note on domination number in maximal outerplanar graphs
Discrete Applied Mathematics, 2021Chanjuan Liu
exaly
On the packing chromatic number of subcubic outerplanar graphs
Discrete Applied Mathematics, 2019Olivier Togni, Přemysl Holub
exaly
Modeling complex networks with self-similar outerplanar unclustered graphs
Physica A: Statistical Mechanics and Its Applications, 2009Francesc Comellas
exaly
Straight-line drawings of outerplanar graphs in O(dnlogn) area
Computational Geometry: Theory and Applications, 2012Fabrizio Frati
exaly
Edge covering pseudo-outerplanar graphs with forests
Discrete Mathematics, 2012Xin Zhang, Jian-Liang Wu, Guizhen Liu
exaly
On the edge-length ratio of outerplanar graphs
Theoretical Computer Science, 2019Giuseppe Liotta, William Lenhart
exaly