相关论文: A note on Goldberg's conjecture on total chromatic…

Let $H =(\mathcal{M} \cup \mathcal{J} ,E \cup \mathcal{E})$ be a hypergraph with two hypervertices $\mathcal{G}_1$ and $\mathcal{G}_2$ where $\mathcal{M} =\mathcal{G}_{1} \cup \mathcal{G}_{2}$ and $\mathcal{G}_{1} \cap \mathcal{G}_{2}…

A strong edge-coloring of a graph $G$ is an edge-coloring such that no two edges of distance at most two receive the same color. The strong chromatic index $\chi'_s(G)$ is the minimum number of colors in a strong edge-coloring of $G$. P.…

Vizing and Gupta showed that the chromatic index $\chi'(G)$ of a graph $G$ is bounded above by $\Delta(G) + \mu(G)$, where $\Delta(G)$ and $\mu(G)$ denote the maximum degree and the maximum multiplicity of $G$, respectively. Steffen refined…

Let $G$ be a simple graph with maximum degree $\Delta$. A classic result of Vizing shows that $\chi'(G)$, the chromatic index of $G$, is either $\Delta$ or $\Delta+1$. We say $G$ is of \emph{Class 1} if $\chi'(G)=\Delta$, and is of…

Given a graph $G$, denote by $\Delta$ and $\chi^\prime$ the maximum degree and the chromatic index of $G$, respectively. A simple graph $G$ is called {\it edge-$\Delta$-critical} if $\chi^\prime(G)=\Delta+1$ and $\chi^\prime(H)\le\Delta$…

Ohba has conjectured \cite{ohb} that if the graph $G$ has $2\chi(G)+1$ or fewer vertices then the list chromatic number and chromatic number of $G$ are equal. In this paper we prove that this conjecture is asymptotically correct. More…

Let $G$ be a simple graph with maximum degree $\Delta(G)$. A subgraph $H$ of $G$ is overfull if $|E(H)|>\Delta(G)\lfloor \frac{1}{2}|V(H)| \rfloor$. Chetwynd and Hilton in 1986 conjectured that a graph $G$ with $\Delta(G)>\frac{1}{3}|V(G)|$…

We consider infinite graphs. The distinguishing number $D(G)$ of a graph $G$ is the minimum number of colours in a vertex colouring of $G$ that is preserved only by the trivial automorphism. An analogous invariant for edge colourings is…

The smallest integer $k$ needed for the assignment of colors to the elements so that the coloring is proper (vertices and edges) is called the total chromatic number of a graph. Vizing and Behzed conjectured that the total coloring can be…

Given a graph or multigraph $G$, let $\chi'_{trans}(G)$ denote the minimum integer $n$ such that any proper $\chi'(G)$--edge coloring of $G$ can be transformed into any other proper $\chi'(G)$--edge coloring of $G$ by a series of…

In 1998, Reed conjectured that for any graph $G$, $\chi(G) \leq \lceil \frac{\omega(G) + \Delta(G)+1}{2}\rceil$, where $\chi(G)$, $\omega(G)$, and $\Delta(G)$ respectively denote the chromatic number, the clique number and the maximum…

Let $G$ be a graph with maximum degree $\Delta$ and without isolated vertices. An edge colouring $c$ of $G$ is conflict-free if the closed neighbourhood of every edge includes a uniquely coloured element. The least number of colours…

Consider a simple graph $G=(V,E)$ of maximum degree $\Delta$ and its proper total colouring $c$ with the elements of the set $\{1,2,\ldots,k\}$. The colouring $c$ is said to be \emph{neighbour sum distinguishing} if for every pair of…

Given a proper total $k$-coloring $c:V(G)\cup E(G)\to\{1,2,\ldots,k\}$ of a graph $G$, we define the value of a vertex $v$ to be $c(v) + \sum_{uv \in E(G)} c(uv)$. The smallest integer $k$ such that $G$ has a proper total $k$-coloring whose…

Associated with every graph $G$ of chromatic number $\chi$ is another graph $G'$. The vertex set of $G'$ consists of all $\chi$-colorings of $G$, and two $\chi$-colorings are adjacent when they differ on exactly one vertex. According to a…

Let $G$ be a simple finite connected graph of order $n$ greater than or equal to $3$. We obtain the following results: (1). We apply a result of Hamada and Yoshimura from 1976 and some recent results of Alikhani and Soltani (2020) and…

Albertson conjectured that if graph $G$ has chromatic number $r$, then the crossing number of $G$ is at least that of the complete graph $K_r$. This conjecture in the case $r=5$ is equivalent to the four color theorem. It was verified for…

An $(a:b)$-coloring of a graph $G$ is a function $f$ which maps the vertices of $G$ into $b$-element subsets of some set of size $a$ in such a way that $f(u)$ is disjoint from $f(v)$ for every two adjacent vertices $u$ and $v$ in $G$. The…

Kostochka and Woodall (2001) conjectured that the square of every graph has the same chromatic number and list chromatic number. In 2015 Kim and Park disproved this conjecture for non-bipartite and bipartite graphs. It was asked by several…

Let $G$ be a simple graph with maximum degree $\Delta(G)$. A subgraph $H$ of $G$ is overfull if $|E(H)|>\Delta(G)\lfloor |V(H)|/2 \rfloor$. Chetwynd and Hilton in 1985 conjectured that a graph $G$ on $n$ vertices with $\Delta(G)>n/3$ has…