Related papers: Circular colorings, orientations, and weighted dig…
Assume $G$ is a graph. We view $G$ as a symmetric digraph, in which each edge $uv$ of $G$ is replaced by a pair of opposite arcs $e=(u,v)$ and $e^{-1}=(v,u)$. Assume $S$ is an inverse closed subset of permutations of positive integers. We…
Let $\mathcal{C} = \{c_1,c_2, c_3, \ldots,c_k\}$ be a certain type of proper $k$-colouring of a given graph $G$ and $\theta(c_i)$ denote the number of times a particular colour $c_i$ is assigned to the vertices of $G$. Then, the colouring…
A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman's algorithm. Algebraic properties of periodic, strongly connected digraphs are…
This is a survey of the method of graph cuts and its applications to graph clustering of weighted unsigned and signed graphs. I provide a fairly thorough treatment of the method of normalized graph cuts, a deeply original method due to Shi…
Edwards, van den Heuvel, Kang, and Sereni conjectured the following strengthening of Vizing's Theorem: let $G$ be a simple graph, and let $K = \Delta(G) + 1$. For any matching $M$ in $G$ and any precoloring of the edges in $M$ using the…
A colouring of a digraph as defined by Erdos and Neumann-Lara in 1980 is a vertex-colouring such that no monochromatic directed cycles exist. The minimal number of colours required for such a colouring of a loopless digraph is defined to be…
A defective $k$-coloring is a coloring on the vertices of a graph using colors $1,2, \dots, k$ such that adjacent vertices may share the same color. A $(d_1,d_2)$-\emph{coloring} of a graph $G$ is a defective $2$-coloring of $G$ such that…
The generalized coloring numbers of Kierstead and Yang (Order 2003) offer an algorithmically-useful characterization of graph classes with bounded expansion. In this work, we consider the hardness and approximability of these parameters.…
Duffy et al. [C. Duffy, G. MacGillivray, and \'E. Sopena, Oriented colourings of graphs with maximum degree three and four, Discrete Mathematics, 342(4), p. 959--974, 2019] recently considered the oriented chromatic number of connected…
Combining Ky Fan's theorem with ideas of Greene and Matousek we prove a generalization of Dol'nikov's theorem. Using another variant of the Borsuk-Ulam theorem due to Bacon and Tucker, we also prove the presence of all possible completely…
A proper $q$-coloring of a graph is an assignment of one of $q$ colors to each vertex of the graph so that adjacent vertices are colored differently. Sample uniformly among all proper $q$-colorings of a large discrete cube in the integer…
The results of this note were stated in the first author PhD manuscript in 2006 but never published. The writing of a proof given there was slightly careless and the proof itself scattered across the document, the goal of this note is to…
DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced by Dvo\u{r}\'{a}k and Postle (2017). Recently, Huang et al. [https://doi.org/10.1016/j.amc.2019.124562] showed that planar graphs with…
L.M.Vitaver [1962] and G.I.Minty [1962] suggested criteria for vertex colorability of a graph in at most a given number of colors; these criteria are stated in terms of the orientation of the edges. One additional criterion of this kind is…
Wang and Lih in 2002 conjectured that every planar graph without adjacent triangles is 4-choosable. In this paper, we prove that every planar graph without any 4-cycle adjacent to two triangles is DP-4-colorable, which improves the results…
A majority coloring of a directed graph is a vertex-coloring in which every vertex has the same color as at most half of its out-neighbors. Kreutzer, Oum, Seymour, van der Zypen and Wood proved that every digraph has a majority 4-coloring…
In this article, we use a unified approach to prove several classes of planar graphs are DP-$3$-colorable, which extend the corresponding results on $3$-choosability.
For a simple graph G = (V, E) and a positive integer k greater than or equal to 2, a coloring of vertices of G using exactly k colors such that each vertex has an equal number of neighbors of each color is called neighborhood-balanced…
We give some illustrative applications of our recent result on decompositions of labelled complexes, including some new results on decompositions of hypergraphs with coloured or directed edges. For example, we give fairly general conditions…
The mean color number of an $n$-vertex graph $G$, denoted by $\mu(G)$, is the average number of colors used in all proper $n$-colorings of $G$. For any graph $G$ and a vertex $w$ in $G$, Dong (2003) conjectured that if $H$ is a graph…