相关论文: Proof of the List Coloring Conjecture for line per…
The notion of a Galvin orientation of a line graph is introduced, generalizing the idea used by Galvin in his landmark proof of the list-edge-colouring conjecture for bipartite graphs. If L(G) has a proper Galvin orientation with respect to…
A famous theorem of Galvin states that the list chromatic number of the intersection of two partition matroids equals its chromatic number. Kiraly and Berczi et. al. conjectured that this equality holds for any two matroids. We prove this…
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…
This paper has been withdrawn by the author. Peterson and Woodall previously proved that the list-edge-colouring conjecture holds for graphs without odd cycles of length 5 or longer. D. Peterson and D. R. Woodall, Edge-choosability in…
We show in this paper that a split-comparability graph $G$ has chromatic index equal to $\Delta(G) + 1$ if and only if $G$ is neighborhood-overfull. That implies the validity of the Overfull Conjecture for the class of split-comparability…
List packing is a notion that was introduced in 2021 (by Cambie et al.). The list packing number of a graph $G$, denoted $\chi_{\ell}^*(G)$, is the least $k$ such that for any list assignment $L$ that assigns $k$ colors to each vertex of…
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…
In 1995, Galvin proved that a bipartite graph $G$ admits a list edge coloring if every edge is assigned a color list of length $\Delta(G)$, the maximum degree of the graph. This result was improved by Borodin, Kostochka and Woodall, who…
We prove that there exist perfect graphs of arbitrarily large clique-chromatic number. These graphs can be obtained from cobipartite graphs by repeatedly gluing along cliques. This negatively answers a question raised by Duffus, Sands,…
A linear coloring of a graph is a proper coloring of the vertices of the graph so that each pair of color classes induce a union of disjoint paths. In this paper, we prove that for every connected graph with maximum degree at most three and…
The famous List Colouring Conjecture from the 1970s states that for every graph $G$ the chromatic index of $G$ is equal to its list chromatic index. In 1996 in a seminal paper, Kahn proved that the List Colouring Conjecture holds…
We show that, given an infinite cardinal $\mu$, a graph has colouring number at most $\mu$ if and only if it contains neither of two types of subgraph. We also show that every graph with infinite colouring number has a well-ordering of its…
An equitable coloring of a graph $G$ is a proper vertex coloring of $G$ such that the sizes of any two color classes differ by at most one. In the paper, we pose a conjecture that offers a gap-one bound for the smallest number of colors…
A majority coloring of a directed graph is a vertex coloring in which each vertex has the same color as at most half of its out-neighbors. In this note we simplify some proof techniques and generalize previously known results on various…
A majority edge-coloring of a graph without pendant edges is a coloring of its edges such that, for every vertex $v$ and every color $\alpha$, there are at most as many edges incident to $v$ colored with $\alpha$ as with all other colors.…
We give a simpler proof of Seymour's Theorem on edge-coloring series-parallel multigraphs and derive a linear-time algorithm to check whether a given series-parallel multigraph can be colored with a given number of colors.
List colouring is an NP-complete decision problem even if the total number of colours is three. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving list colouring of permutation graphs with a bounded…
Our motivation is the question of how similar the $f$-colouring problem is to the classic edge-colouring problem, particularly with regard to graph parameters. In 2010, Zhang, Yu, and Liu gave a new description of the $f$-matching polytope…
A vertex coloring of a given simple graph $G=(V,E)$ with $k$ colors ($k$-coloring) is a map from its vertex set to the set of integers $\{1,2,3,\dots, k\}$. A coloring is called perfect if the multiset of colors appearing on the neighbours…
Let $G$ be a simple graph with $n$ vertices and list chromatic number $\chi_\ell(G)=\chi_\ell$. Suppose that $0\leq t\leq \chi_\ell$ and each vertex of $G$ is assigned a list of $t$ colors. Albertson, Grossman and Haas [1] conjectured that…