Skip to content
Preprint

An improved upper bound for the fair domination number of maximal outerplanar graphs

Sep 2026 · 0 citations · 7 references
Mathematics

Abstract

A dominating set $D$ of a graph $G$ is a \emph{fair dominating set} if every two vertices outside $D$ have the same number of neighbors in $D$, and the \emph{fair domination number} $\mathrm{fd}(G)$ is the minimum cardinality of such a set. Caro, Hansberg and Henning, who introduced this parameter, proved that $\mathrm{fd}(G)<17n/19$ for every maximal outerplanar graph $G$ of order $n\geq3$, and asked whether this bound is asymptotically best possible. We show that it is not the case by proving $\mathrm{fd}(G)\leq(7n-3)/8<7n/8$ for every maximal outerplanar graph $G$ of order $n\geq3$, and we exhibit an infinite family of maximal outerplanar graphs with $\mathrm{fd}(G)/n\rightarrow7/9$, so that the best asymptotic constant lies between $7/9$ and $7/8$.

View source

Similar papers

Preprint Sep 2026

The diameter of recoloring graphs under a maximum average degree bound

For a graph $G$, we write $\mathrm{mad}(G)$ for its maximum average degree and $\mathrm{diam} G$ for its diameter. Let $R_k(G)$ be the graph whose vertices are the proper colorings of $G$ with $k$ colors, where two colorings are adjacent when they differ at one vertex. Feghali (JCTB, 2021) proved that, for fixed intege...

Rui-Lin Zheng, Jun-Ying Lu · 0 citations
Preprint Sep 2026

A stronger upper bound on the D-chromatic index

For a graph $G$, a proper edge coloring of $G$ is called a D-coloring if every diamond subgraph of $G$ is rainbow. Let $\chi'_D(G)$ be the D-chromatic index of $G$, which is the smallest integer $k$ such that $G$ admits a D-coloring with $k$ colors. Let $\Delta$ be the maximum degree of $G$. The only known Brooks-type...

Lin Tian, Run-Ze Wang · 0 citations
Review Oct 2026

Proof of the mad conjecture and its coloring applications

For a finite graph $G$, the maximum average degree $\operatorname{mad}(G)$ is the largest average degree of a nonempty subgraph of $G$. Hendrey, Norin and Wood asked whether this parameter is partitionable, that is, whether for all positive reals $a,b$ every graph $G$ with $\operatorname{mad}(G)<a+b$ admits a vertex pa...

Andrzej Grzesik, Lenka Kopfová, Gaurav Kucheriya et al. · 0 citations
Preprint Sep 2026

Bounded chromatic number of graphs with small clique number and large minimum degree

We prove that every triangle-free graph with minimum degree at least $\frac{n}{3}$ is $4$-colorable and thereby settle a problem of Brandt and Thomass\'e (2005) at the threshold $\frac{n}{3}$. The number four is best possible. For a positive integer-valued function $f(n)=o(n)$, we relate the chromatic number of $f(n)$-...

Jia-Ao Li, Xin-Yuan Li · 0 citations
Preprint Sep 2026

Paired Domination in Cubic Bipartite Graphs

A paired dominating set of a graph $G$ is a dominating set $D$ such that $G[D]$ has a perfect matching. The minimum size of such a set is the paired domination number $\gpr(G)$. Desormeaux and Henning conjectured that every cubic bipartite graph $G$ of order $n$ satisfies $\gpr(G)\le n/2$. We prove the conjecture in th...

Chang-Hong Lu, Qi Wu · 0 citations
Preprint Aug 2026

Disconnected graphs and extremal bounds for realizable distance orders

Let $G$ be a graph together with a total order $\prec$ on its edges. We say that $\prec$ is realizable in $\mathbb{R}^d$ if there is a placement of the vertices of $G$ in $\mathbb{R}^d$ such that the Euclidean lengths of the edges induce exactly the order $\prec$. Almendra-Hern\'andez and Mart\'inez-Sandoval proved tha...

Gerardo L. Maldonado, Leonardo Martínez-Sandoval, Miguel Raggi et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.