Related papers: Dominated Minimal Separators are Tame (Nearly All …

A graph is \emph{$(\mathcal{I}, \mathcal{F})$-partitionable} if its vertex set can be partitioned into two parts such that one part $\mathcal{I}$ is an independent set, and the other $\mathcal{F}$ induces a forest. A graph is…

A $k$-edge-colored graph is a finite, simple graph with edges labeled by numbers $1,\ldots,k$. A function from the vertex set of one $k$-edge-colored graph to another is a homomorphism if the endpoints of any edge are mapped to two…

A set $S$ of vertices in $G$ is a semitotal dominating set of $G$ if it is a dominating set of $G$ and every vertex in $S$ is within distance $2$ of another vertex of $S$. The \emph{semitotal domination number}, $\gamma_{t2}(G)$, is the…

Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $D\subseteq V$ such that every vertex not in $D$ is adjacent to at least one vertex in $D$.The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is…

For a graph G, the k-total dominating graph D_{k}^{t}(G) is the graph whose vertices correspond to the total dominating sets of G that have cardinality at most k; two vertices of D_{k}^{t}(G) are adjacent if and only if the corresponding…

A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-covered graphs. While the recognition problem for the class…

The Havel-Hakimi algorithm iteratively reduces the degree sequence of a graph to a list of zeroes. As shown by Favaron, Mah\'eo, and Sacl\'e, the number of zeroes produced, known as the residue, is a lower bound on the independence number…

We introduce a dense counterpart of graph degeneracy, which extends the recently-proposed invariant symmetric difference. We say that a graph has sd-degeneracy (for symmetric-difference degeneracy) at most $d$ if it admits an elimination…

Augustine et al. [DISC 2022] initiated the study of distributed graph algorithms in the presence of Byzantine nodes in the congested clique model. In this model, there is a set $B$ of Byzantine nodes, where $|B|$ is less than a third of the…

A dominating set in a graph $G$ is a set $S$ of vertices such that every vertex that does not belong to $S$ is adjacent to a vertex in $S$. The domination number $\gamma(G)$ of $G$ is the minimum cardinality of a dominating set of $G$. The…

Suppose $\mathcal{F}$ is a finite family of graphs. We consider the following meta-problem, called $\mathcal{F}$-Immersion Deletion: given a graph $G$ and integer $k$, decide whether the deletion of at most $k$ edges of $G$ can result in a…

Two graphs are homomorphism indistinguishable over a graph class $\mathcal{F}$, denoted by $G \equiv_{\mathcal{F}} H$, if $\operatorname{hom}(F,G) = \operatorname{hom}(F,H)$ for all $F \in \mathcal{F}$ where $\operatorname{hom}(F,G)$…

A set $S\subseteq V$ is a dominating set of $G$ if every vertex in $V - S$ is adjacent to at least one vertex in $S$. The domination number $\gamma(G)$ of $G$ equals the minimum cardinality of a dominating set $S$ in $G$; we say that such a…

A graph $G$ is $[a,b]$-covered if for each edge $e$ of $G$ there is an $[a,b]$-factor containing it. For $a=b=1$, an $[a,b]$-covered graph is a matching covered graph. The structural theory of matching covered graphs constitutes a…

Let $G$ be a simple graph of order $n$ and let $k$ be an integer such that $1\leq k\leq n-1$. The $k$-token graph $G^{\{k\}}$ of $G$ is the graph whose vertices are the $k$-subsets of $V(G)$, where two vertices are adjacent in $G^{\{k\}}$…

We show that the dominating set problem parameterized by solution size is fixed-parameter tractable (FPT) in graphs that do not contain the claw (K(1,3)), the complete bipartite graph on four vertices where the two parts have one and three…

Let $\mathcal{D}_k$ be the class of graphs for which every minor has minimum degree at most $k$. Then $\mathcal{D}_k$ is closed under taking minors. By the Robertson-Seymour graph minor theorem, $\mathcal{D}_k$ is characterised by a finite…

For an integer $k \ge 1$, a (distance) $k$-dominating set of a connected graph $G$ is a set $S$ of vertices of $G$ such that every vertex of $V(G) \setminus S$ is at distance at most~$k$ from some vertex of $S$. The $k$-domination number,…

A set $D$ of vertices in a graph $G$ is a dominating set if every vertex of $G$, which is not in $D$, has a neighbor in $D$. A set of vertices $D$ in $G$ is convex (respectively, isometric), if all vertices in all shortest paths…

Given a graph G, a colouring is an assignment of colours to the vertices of G so that no two adjacent vertices are coloured the same. If all colour classes have size at most t, then we call the colouring t-bounded, and the t-bounded…