Results 101 to 110 of about 3,997 (179)
On Large Induced Outerplanar Subgraphs in $2$-Outerplanar Graphs
Borradaile, Le and Sherman-Bennett [Graphs and Combinatorics, 2017] proved that every $n$-vertex $2$-outerplane graph has a set of at least $2n/3$ vertices that induces an outerplane graph. We identify a major flaw in their proof and recover their result with a different, and unfortunately much more complex, proof.
D'Elia, Marco, Frati, Fabrizio
openaire +2 more sources
On the k-Structure Ratio in Planar and Outerplanar Graphs
A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-
Gruia Calinescu, Cristina G. Fernandes
doaj
Non-Preemptive Tree Packing. [PDF]
Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
On Colorings of Squares of Outerplanar Graphs
24 pages, 17 ...
Geir Agnarsson, Magnús M. Halldórsson
openaire +3 more sources
Mitochondrial networks through the lens of mathematics. [PDF]
Lewis GR, Marshall WF.
europepmc +1 more source
The complexity of frugal colouring. [PDF]
Bard S, MacGillivray G, Redlin S.
europepmc +1 more source
Rainbow subgraphs in edge-colored planar and outerplanar graphs [PDF]
Július Czap
doaj +1 more source
Horizontal visibility graph of a random restricted growth sequence. [PDF]
Mansour T, Rastegar R, Roitershtein A.
europepmc +1 more source
Induced cycle structure and outerplanarity
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Approximate realizations for outerplanaric degree sequences
We study the question of whether a sequence d = (d_1,d_2, \ldots, d_n) of positive integers is the degree sequence of some outerplanar (a.k.a. 1-page book embeddable) graph G. If so, G is an outerplanar realization of d and d is an outerplanaric sequence.
Amotz Bar-Noy +4 more
openaire +3 more sources

