10 citations · 46 across the 64 of their papers we have counts for
80 papers · 1 filter
Spreads of degrees in maximal planar graphs -- an exposition
Yair Caro, Riste Škrekovski, Christina Zarb
For a graph and a set , the spread of is the difference between the largest and the smallest degree in of a vertex of , and for an…
The strong (non-induced) Turán numbers
Yair Caro, Zsolt Tuza
In this paper we introduce and explore the following new graph invariant: For a graph on vertices, , let denote the maximum number of edges in a graph…
An improved upper bound for the fair domination number of maximal outerplanar graphs
Yair Caro, Riste Škrekovski
A dominating set of a graph is a \emph{fair dominating set} if every two vertices outside have the same number of neighbors in , and the \emph{fair domination number…
Spreads of degrees in graphs
Yair Caro, Riste Škrekovski, Christina Zarb
For a graph and a set , the spread of is the difference between the largest and the smallest degree in of a vertex of , and for an…
Ramsey properties of maximal (outer)planar graphs
Adriana Baldacchino, Yair Caro, Xandru Mifsud
We study a natural extension of Ramsey theory relative to the classes of maximally planar and maximally outerplanar graphs. This can be seen as a continuation of the study of `Plan…
Induced/Incomparable versus Ramsey
Yair Caro, Zsolt Tuza, Christina Zarb
We consider the following problem: Let and be two graphs on vertices and assume . We say that and are incomparable if neither nor contains the…