相关论文: On game chromatic vertex-critical graphs

A graph \( G \) is said to be (vertex) non-repetitively colored if no simple path in \( G \) has a sequence of vertex colors that forms a repetition. Formally, a coloring \( c: V(G) \to \{1, 2, \dots, k\} \) is non-repetitive if, for every…

A $b$-coloring of a graph $G$ is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the other color classes. The b-Coloring problem asks whether a graph $G$ has a…

A graph $G$ is $k$-vertex-critical if $\chi(G)=k$, but $\chi(G')<k$ for every proper induced subgraph $G'$ of $G$. For a family of graphs $\mathcal{F}$, $G$ is $\mathcal{F}$-free if no graph $F \in \mathcal{F}$ is an induced subgraph of…

In this paper we introduce a variation of the well-known Zagreb indices by considering a proper vertex colouring of a graph $G$. The chromatic Zagreb indices are defined in terms of the parameter $c(v), v \in V(G)$ instead of the invariant…

Coloring games are combinatorial games where the players alternate painting uncolored vertices of a graph one of $k > 0$ colors. Each different ruleset specifies that game's coloring constraints. This paper investigates six impartial…

A coloring of edges of a graph $G$ is injective if for any two distinct edges $e_1$ and $e_2$, the colors of $e_1$ and $e_2$ are distinct if they are at distance $1$ in $G$ or in a common triangle. Naturally, the injective chromatic index…

A vertex coloring of a graph is said to be pseudocomplete if, for any two distinct colors, there exists at least one edge with those two colors as its end vertices. The pseudoachromatic number of a graph is the greatest number of colors…

A graph is locally irregular if the degrees of the end-vertices of every edge are distinct. An edge coloring of a graph G is locally irregular if every color induces a locally irregular subgraph of G. A colorable graph G is any graph which…

Let $G$ be a simple graph with maximum degree $\Delta(G)$ and chromatic index $\chi'(G)$. A classic result of Vizing indicates that either $\chi'(G )=\Delta(G)$ or $\chi'(G )=\Delta(G)+1$. The graph $G$ is called $\Delta$-critical if $G$ is…

Given a (proper) vertex coloring $f$ of a graph $G$, say $f\colon V(G)\to \mathbb{N}$, the difference edge labelling induced by $f$ is a function $h\colon E(G)\to \mathbb{N}$ defined as $h(uv)=|f(u)-f(v)|$ for every edge $uv$ of $G$. A…

An ordered graph $G$ is a graph together with a specified linear ordering on the vertices, and its interval chromatic number is the minimum number of independent sets consisting of consecutive vertices that are needed to partition the…

It was conjectured by Ohba and confirmed recently by Noel et al. that, for any graph $G$, if $|V(G)|\le 2\chi(G)+1$ then $\chi_l(G)=\chi(G)$. This indicates that the graphs with high chromatic number are chromatic-choosable. We show that…

A set $S\subseteq V$ is \textit{independent} in a graph $G=\left( V,E\right) $ if no two vertices from $S$ are adjacent. The \textit{independence number} $\alpha(G)$ is the cardinality of a maximum independent set, while $\mu(G)$ is the…

In this paper we consider a variation of a recoloring problem, called the Color-Fixing. Let us have some non-proper $r$-coloring $\varphi$ of a graph $G$. We investigate the problem of finding a proper $r$-coloring of $G$, which is "the…

The dichromatic number $\chi(\vec{G})$ of a digraph $\vec{G}$ is the minimum number of colors needed to color the vertices $V(\vec{G})$ in such a way that no monochromatic directed cycle is obtained. In this note, for any $k\in \mathbb{N}$,…

Let $\text{ch}(G)$ denote the choice number of a graph $G$ (also called "list chromatic number" or "choosability" of $G$). Noel, Reed, and Wu proved the conjecture of Ohba that $\text{ch}(G)=\chi(G)$ when $|V(G)|\le 2\chi(G)+1$. We extend…

In this paper, we introduce and study a novel graph parameter called the $k$-defect number, denoted $\phi_{k}(G)$, for a graph $G$ and an integer $0\leq k\leq |E(G)|$. Unlike traditional defective colorings that bound the local degree…

A 2-distance k-coloring of a graph G is a mapping from V (G) to the set of colors {1,. .. , k} such that every two vertices at distance at most 2 receive distinct colors. The 2-distance chromatic number $\chi$ 2 (G) of G is then the mallest…

In the context of the chromatic-number problem, a critical graph is an instance where the deletion of any element would decrease the graph's chromatic number. Such instances have shown to be interesting objects of study for deepen the…

In a colouring of a graph, a vertex is b-chromatic if it is adjacent to a vertex of every other colour. We consider four well-studied colouring problems: b-Chromatic Number, Tight b-Chromatic Number, Fall Chromatic Number and Fall…