相关论文: A note on Reed's conjecture

We prove that for any graph $G$, the total chromatic number of $G$ is at most $\Delta(G)+2\left\lceil \frac{|V(G)|}{\Delta(G)+1} \right\rceil$. This saves one color in comparison with a result of Hind from 1992. In particular, our result…

A copy of a graph $F$ is called an $F$-copy. For any graph $G$, the $F$-isolation number of $G$, denoted by $\iota(G,F)$, is the size of a smallest subset $D$ of the vertex set of $G$ such that the closed neighbourhood $N[D]$ of $D$ in $G$…

Let $G$ be a simple graph, and let $n$, $\Delta(G)$ and $\chi' (G)$ be the order, the maximum degree and the chromatic index of $G$, respectively. We call $G$ overfull if $|E(G)|/\lfloor n/2\rfloor > \Delta(G)$, and critical if $\chi'(H) <…

The Chen-Lih-Wu Conjecture states that each connected graph with maximum degree $\Delta\geq 3$ that is not the complete graph $K_{\Delta+1}$ or the complete bipartite graph $K_{\Delta,\Delta}$ admits an equitable coloring with $\Delta$…

We show that for any constant $\Delta \ge 2$, there exists a graph $G$ with $O(n^{\Delta / 2})$ vertices which contains every $n$-vertex graph with maximum degree $\Delta$ as an induced subgraph. For odd $\Delta$ this significantly improves…

A hole is an induced cycle of length at least 4. Let $\l\ge 2$ be a positive integer, let ${\cal G}_l$ denote the family of graphs which have girth $2\l+1$ and have no holes of odd length at least $2\l+3$, and let $G\in {\cal G}_{\l}$. For…

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…

The square $G^2$ of a graph $G$ is the graph defined on $V(G)$ such that two vertices $u$ and $v$ are adjacent in $G^2$ if the distance between $u$ and $v$ in $G$ is at most 2. The {\em maximum average degree} of $G$, $mad (G)$, is the…

A bisection of a graph is a bipartition of its vertex set such that the two resulting parts differ in size by at most 1, and its size is the number of edges that connect vertices in the two parts. The perfect matching condition and…

We denote a path on $t$ vertices as $P_t$ and a cycle on $t$ vertices as $C_t$. For two vertex-disjoint graphs $G_1$ and $G_2$, the {\em union} $G_1\cup G_2$ is the graph with $V(G_1\cup G_2)=V(G_1)\cup V(G_2)$ and $E(G_1\cup…

Alon and Krivelevich conjectured that if $G$ is a bipartite graph of maximum degree $\Delta$, then the choosability (or list chromatic number) of $G$ satisfies $\chi_{\ell}(G) = O \left ( \log \Delta \right )$. Currently, the best known…

Two graphs $G_{1} = (V_{1}, E_{1})$ and $G_{2} = (V_{2}, E_{2})$, each of order $n$, pack if there exists a bijection $f$ from $V_{1}$ onto $V_{2}$ such that $uv \in E_{1}$ implies $f(u)f(v) \notin E_{2}$. In 2014, \.{Z}ak proved that if…

In 2000, Enomoto and Ota conjectured that if a graph $G$ satisfies $\sigma_{2}(G) \geq n + k - 1$, then for any set of $k$ vertices $v_{1}, \dots, v_{k}$ and for any positive integers $n_{1}, \dots, n_{k}$ with $\sum n_{i} = |G|$, there…

Let $G$ be a connected graph with maximum degree $\Delta \ge 3$. We investigate the upper bound for the chromatic number $\chi_\gamma(G)$ of the power graph $G^\gamma$. It was proved that $\chi_\gamma(G)…

We prove two conjectures in spectral extremal graph theory involving the linear combinations of graph eigenvalues. Let $\lambda_1(G)$ be the largest eigenvalue of the adjacency matrix of a graph $G$, and $\bar{G}$ be the complement of $G$.…

For any graph $G$, we define the power $\pi(G)$ as the minimum of the largest number of neighbors in a $\gamma$-set of $G$, of any vertex, taken over all $\gamma$-sets of $G$. We show that $\gamma(G\square H)\geq \frac{\pi(G)}{2\pi(G)…

Let $a$ and $b$ be positive integers. An even $[a,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that for every vertex $v \in V(G)$, $d_H(v)$ is even and $a \le d_H(v) \le b$. Matsuda conjectured that if $G$ is an $n$-vertex…

In this paper we define and study a new family of graphs that generalises the notions of line graphs and path graphs. Let $G$ be a graph with no loops but possibly with parallel edges. An \emph{$\ell$-link} of $G$ is a walk of $G$ of length…

Let $\delta$ and $\Delta$ be the minimum and the maximum degree of the vertices of a simple connected graph $G$, respectively. The distinguishing index of a graph $G$, denoted by $D'(G)$, is the least number of labels in an edge labeling of…

A recent result by Kardo\v{s}, M\'a\v{c}ajov\'a and Zerafa [J. Comb. Theory, Ser. B. 160 (2023) 1--14] related to the famous Berge-Fulkerson conjecture implies that given an arbitrary set of odd pairwise edge-disjoint cycles, say $\mathcal…