Results 81 to 90 of about 181 (161)

Area-Universality in Outerplanar Graphs

open access: yes
17 ...
Ravi Suthar   +2 more
openaire   +2 more sources

Light graphs in families of outerplanar graphs

open access: yesDiscrete Mathematics, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A Note on the Fair Domination Number in Outerplanar Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2020
For k ≥ 1, a k-fair dominating set (or just kFD-set), in a graph G is a dominating set S such that |N(v) ∩ S| = k for every vertex v ∈ V − S. The k-fair domination number of G, denoted by fdk(G), is the minimum cardinality of a kFD-set. A fair dominating
Hajian Majid, Rad Nader Jafari
doaj   +1 more source

On Large Induced Outerplanar Subgraphs in $2$-Outerplanar Graphs

open access: yesCoRR
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.
Marco D'Elia, Fabrizio Frati
openaire   +2 more sources

On the k-Structure Ratio in Planar and Outerplanar Graphs

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
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  

On Colorings of Squares of Outerplanar Graphs

open access: yes, 2007
24 pages, 17 ...
Geir Agnarsson, Magnús M. Halldórsson
openaire   +3 more sources

𝒫-Apex Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2018
Let 𝒫 be an arbitrary class of graphs that is closed under taking induced subgraphs and let 𝒞 (𝒫) be the family of forbidden subgraphs for 𝒫. We investigate the class 𝒫 (k) consisting of all the graphs G for which the removal of no more than k vertices ...
Borowiecki Mieczysław   +2 more
doaj   +1 more source

Non-Preemptive Tree Packing. [PDF]

open access: yesAlgorithmica, 2023
Lendl S, Woeginger G, Wulf L.
europepmc   +1 more source

Home - About - Disclaimer - Privacy