An $acyclic$ edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The \emph{acyclic chromatic index} of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by $a'(G)$. It was conjectured by Alon, Sudakov and Zaks (and much earlier by Fiamcik) that $a'(G)\le Δ+2$, where $Δ=Δ(G)$ denotes the maximum degree of the graph. We prove that if $G$ is a planar graph with maximum degree $Δ$, then $a'(G)\le Δ+ 12$.
An $acyclic$ edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The \emph{acyclic chromatic index} of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by $a'(G)$. It was conjectured by Alon, Sudakov and Zaks (and much earlier by Fiamcik) that $a'(G)\le Δ+2$, where $Δ=Δ(G)$ denotes the maximum degree of the graph. If every induced subgraph $H$ of $G$ satisfies the condition $\vert E(H) \vert \le 2\vert V(H) \vert -1$, we say that the graph $G$ satisfies $Property\ A$. In this paper, we prove that…
We consider acyclic r-colorings in graphs and digraphs: they color the vertices in r colors, each of which induces an acyclic graph or digraph. (This includes the dichromatic number of a digraph, and the arboricity of a graph.) For any girth and sufficiently high degree, we prove the NP-completeness of acyclic r-colorings; our method also implies the known analogue for classical colorings. The proofs use high girth graphs with high arboricity and dichromatic numbers. High girth graphs and digraphs with high chromatic and dichromatic numbers have been well studied; we re-derive the results from…
A proper edge coloring of a graph $G$ is called acyclic if there is no bichromatic cycle in $G$. The acyclic chromatic index of $G$, denoted by $χ'_a(G)$, is the least number of colors $k$ such that $G$ has an acyclic edge $k$-coloring. The maximum average degree of a graph $G$, denoted by $\mad(G)$, is the maximum of the average degree of all subgraphs of $G$. In this paper, it is proved that if $\mad(G)<4$, then $χ'_a(G)\leq{Δ(G)+2}$; if $\mad(G)<3$, then $χ'_a(G)\leq{Δ(G)+1}$. This implies that every triangle-free planar graph $G$ is acyclically edge $(Δ(G)+2)$-colorable.
An \emph{acyclic coloring} of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The more restricted notion of \emph{star coloring} requires that the union of any two color classes induces a disjoint collection of stars. We prove that every acyclic coloring of a cograph is also a star coloring and give a linear-time algorithm for finding an optimal acyclic and star coloring of a cograph. If the graph is given in the form of a cotree, the algorithm runs in O(n) time. We also show that the acyclic chromatic number, the star ch…
An acyclic edge-coloring of a graph is a proper edge-coloring without bichromatic ($2$-colored) cycles. The acyclic chromatic index of a graph $G$, denoted by $a'(G)$, is the least integer $k$ such that $G$ admits an acyclic edge-coloring using $k$ colors. Let $Δ= Δ(G)$ denote the maximum degree of a vertex in a graph $G$. A complete bipartite graph with $n$ vertices on each side is denoted by $K_{n,n}$. Basavaraju, Chandran and Kummini proved that $a'(K_{n,n}) \ge n+2 = Δ+ 2$ when $n$ is odd. Basavaraju and Chandran provided an acyclic edge-coloring of $K_{p,p}$ using $p+2$ colors and thus es…
An acyclic edge coloring of a graph $G$ is a proper edge coloring such that no bichromatic cycles are produced. The acyclic edge coloring conjecture by Fiam{č}ik (1978) and Alon, Sudakov and Zaks (2001) states that every simple graph with maximum degree $Δ$ is acyclically edge $(Δ+ 2)$-colorable. Despite many milestones, the conjecture remains open even for planar graphs. In this paper, we confirm affirmatively the conjecture on planar graphs without intersecting triangles. We do so by first showing, by discharging methods, that every planar graph without intersecting triangles must have at le…
An acyclic edge coloring of a graph $G$ is a proper edge coloring such that every cycle is colored with at least three colors. The acyclic chromatic index $\chiup_{a}'(G)$ of a graph $G$ is the least number of colors in an acyclic edge coloring of $G$. It was conjectured that $\chiup'_{a}(G)\leq Δ(G) + 2$ for any simple graph $G$ with maximum degree $Δ(G)$. In this paper, we prove that every planar graph $G$ admits an acyclic edge coloring with $Δ(G) + 6$ colors.
Proper edge coloring of a graph $G$ is called acyclic if there is no bichromatic cycle in $G$. The acyclic chromatic index of $G$, denoted by $χ'_a(G)$, is the least number of colors $k$ such that $G$ has an acyclic edge $k$-coloring. Basavaraju et al. [Acyclic edge-coloring of planar graphs, SIAM J. Discrete Math. 25 (2) (2011), 463--478] showed that $χ'_a(G)\le Δ(G)+12$ for planar graphs $G$ with maximum degree $Δ(G)$. In this paper, the bound is improved to $Δ(G)+10$.
An {\em acyclic edge coloring} of a graph $G$ is a proper edge coloring such that the subgraph induced by any two color classes is a linear forest (an acyclic graph with maximum degree at most two). The {\em acyclic chromatic index} $\chiup_{a}'(G)$ of a graph $G$ is the least number of colors needed in an acyclic edge coloring of $G$. Fiamčík (1978) conjectured that $\chiup_{a}'(G) \leq Δ(G) + 2$, where $Δ(G)$ is the maximum degree of $G$. This conjecture is well known as Acyclic Edge Coloring Conjecture (AECC). A graph $G$ with maximum degree at most $κ$ is {\em $κ$-deletion-minimal} if $\ch…
An acyclic edge coloring of a graph $G$ is a proper edge coloring such that every cycle is colored with at least three colors. The acyclic chromatic index $\chiup_{a}'(G)$ of a graph $G$ is the least number of colors in an acyclic edge coloring of $G$. It was conjectured that $\chiup'_{a}(G)\leq Δ(G) + 2$ for any simple graph $G$ with maximum degree $Δ(G)$. A graph is {\em $1$-planar} if it can be drawn on the plane such that every edge is crossed by at most one other edge. In this paper, we prove that every triangle-free $1$-planar graph $G$ has an acyclic edge coloring with $Δ(G) + 16$ color…
We give a probabilistic analysis of a Moser-type algorithm for the Lovász Local Lemma (LLL), adjusted to search for acyclic edge colorings of a graph. We thus improve the best known upper bound to acyclic chromatic index, also obtained by analyzing a similar algorithm, but through the entropic method (basically counting argument). Specifically we show that a graph with maximum degree $Δ$ has an acyclic proper edge coloring with at most $\lceil 3.74(Δ-1)\rceil+1 $ colors, whereas, previously, the best bound was $4(Δ-1)$. The main contribution of this work is that it comprises a probabilistic an…
We give an algorithm with complexity $O(f(R)^{k^2} k^3 n)$ for the integer multiflow problem on instances $(G,H,r,c)$ with $G$ an acyclic planar digraph and $r+c$ Eulerian. Here, $f$ is a polynomial function, $n = |V(G)|$, $k = |E(H)|$ and $R$ is the maximum request $\max_{h \in E(H)} r(h)$. When $k$ is fixed, this gives a polynomial algorithm for the arc-disjoint paths problem under the same hypothesis.
An acyclic edge coloring of a graph $G$ is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index $a'(G)$ of $G$ is the smallest integer $k$ such that $G$ has an acyclic edge coloring using $k$ colors. Fiam${\rm \check{c}}$ik (1978) and later Alon, Sudakov and Zaks (2001) conjectured that $a'(G)\le Δ+ 2$ for any simple graph $G$ with maximum degree $Δ$. Basavaraju and Chandran (2009) showed that every graph $G$ with $Δ=4$, which is not 4-regular, satisfies the conjecture. In this paper, we settle the 4-regular case, i.e., we show that every 4-regular g…
A graph is called 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we establish a local property of 1-planar graphs which describes the structure in the neighborhood of small vertices (i.e. vertices of degree no more than seven). Meanwhile, some new classes of light graphs in 1-planar graphs with the bounded degree are found. Therefore, two open problems presented by Fabrici and Madaras [The structure of 1-planar graphs, Discrete Mathematics, 307, (2007), 854-865] are solved. Furthermore, we prove that each 1-planar graph $G$ with …
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we confirm the total-coloring conjecture for 1-planar graphs with maximum degree at least 13.
Let G be a planar triangle-free graph and let C be a cycle in G of length at most 8. We characterize all situations where a 3-coloring of C does not extend to a proper 3-coloring of the whole graph.
A graph is $k$-planar if it can be drawn in the plane so that each edge is crossed at most $k$ times. Typically, the class of 1-planar graphs is among the most investigated graph families within the so-called "beyond planar graphs". A dynamic $\ell$-list coloring of a graph is a proper coloring so that each vertex receives a color from a list of $\ell$ distinct candidate colors assigned to it, and meanwhile, there are at least two colors appearing in the neighborhood of every vertex of degree at least two. In this paper, we prove that each 1-planar graph has a dynamic $11$-list coloring. Moreo…
Given a directed graph, an acyclic set is a set of vertices inducing a subgraph with no directed cycle. In this note we show that there exist oriented planar graphs of order $n$ for which the size of the maximum acyclic set is at most $\lceil \frac{n+1}{2} \rceil$, for any $n$. This disproves a conjecture of Harutyunyan and shows that a question of Albertson is best possible.
Using computational techniques we provide a framework for proving results on subclasses of planar graphs via discharging method. The aim of this paper is to apply these techniques to study the 2-distance coloring of planar subcubic graphs. Applying these techniques we show that every subcubic planar graph $G$ of girth at least 8 has 2-distance chromatic number at most 6.
In this paper we study the problem of existence of a crossing-free acyclic hamiltonian path completion (for short, HP-completion) set for embedded upward planar digraphs. In the context of book embeddings, this question becomes: given an embedded upward planar digraph $G$, determine whether there exists an upward 2-page book embedding of $G$ preserving the given planar embedding. Given an embedded $st$-digraph $G$ which has a crossing-free HP-completion set, we show that there always exists a crossing-free HP-completion set with at most two edges per face of $G$. For an embedded $N$-free upwar…
A graph is 1-planar if it can be drawn on a plane so that each edge is crossed by at most one other edge. In this paper, we first give a useful structural theorem for 1-planar graphs, and then apply it to the list edge and list total coloring, the $(p,1)$-total labelling, and the equitable edge coloring of 1-planar graphs. More precisely, we verify the well-known List Edge Coloring Conjecture and List Total Coloring Conjecture for 1-planar graph with maximum degree at least 18, prove that the $(p,1)$-total labelling number of every 1-planar graph $G$ is at most $Δ(G)+2p-2$ provided that $Δ(G)\…
An edge-coloring of a graph $G$ with colors $1,\ldots,t$ is called an \emph{interval $t$-coloring} if all colors are used and the colors of edges incident to each vertex of $G$ are distinct and form an interval of integers. In 1990, Kamalian proved that if a graph $G$ with at least one edge has an interval $t$-coloring, then $t\leq 2|V(G)|-3$. In 2002, Axenovich improved this upper bound for planar graphs: if a planar graph $G$ admits an interval $t$-coloring, then $t\leq \frac{11}{6}|V(G)|$. In the same paper Axenovich suggested a conjecture that if a planar graph $G$ has an interval $t$-colo…
We prove that 3-Coloring remains NP-hard on 4- and 5-regular planar Hamiltonian graphs, strengthening the results of Dailey [Disc. Math.'80] and Fleischner and Sabidussi [J. Graph. Theor.'02]. Moreover, we prove that 3-Coloring remains NP-hard on $p$-regular Hamiltonian graphs for every $p\geq 6$ and $p$-ordered regular Hamiltonian graphs for every $p\geq 3$.
A {\em conflict-free coloring} of a graph {\em with respect to open} (resp., {\em closed}) {\em neighborhood} is a coloring of vertices such that for every vertex there is a color appearing exactly once in its open (resp., closed) neighborhood. Similarly, a {\em unique-maximum coloring} of a graph {\em with respect to open} (resp., {\em closed}) {\em neighborhood} is a coloring of vertices such that for every vertex the maximum color appearing in its open (resp., closed) neighborhood appears exactly once. There is a vast amount of literature on both notions where the colorings need not be prop…
DP-coloring was introduced by Dvořák and Postle as a generalization of list coloring. It was originally used to solve a longstanding conjecture by Borodin, stating that every planar graph without cycles of lengths 4 to 8 is 3-choosable. In this paper, we give three sufficient conditions for a planar graph to be DP-4-colorable. Actually all the results (Theorem 1.3, 1.4 and 1.7) are stated in the ``color extendability'' form, and uniformly proved by vertex identification and discharging method.
We study the exact square chromatic number of subcubic planar graphs. An exact square coloring of a graph G is a vertex-coloring in which any two vertices at distance exactly 2 receive distinct colors. The smallest number of colors used in such a coloring of G is its exact square chromatic number, denoted $χ^{\sharp 2}(G)$. This notion is related to other types of distance-based colorings, as well as to injective coloring. Indeed, for triangle-free graphs, exact square coloring and injective coloring coincide. We prove tight bounds on special subclasses of planar graphs: subcubic bipartite pla…
It is well known that any set of n intervals in $\mathbb{R}^1$ admits a non-monochromatic coloring with two colors and a conflict-free coloring with three colors. We investigate generalizations of this result to colorings of objects in more complex 1-dimensional spaces, namely so-called tree spaces and planar network spaces.
We study the \emph{maximum differential coloring problem}, where the vertices of an $n$-vertex graph must be labeled with distinct numbers ranging from $1$ to $n$, so that the minimum absolute difference between two labels of any two adjacent vertices is maximized. As the problem is \NPH for general graphs~\cite{leung1984}, we consider planar graphs and subclasses thereof. We initially prove that the maximum differential coloring problem remains \NPH, even for planar graphs. Then, we present tight bounds for regular caterpillars and spider graphs. Using these new bounds, we prove that the Mill…
The discharging method is a powerful proof technique, especially for graph coloring problems. Its major downside is that it often requires lengthy case analyses, which are sometimes given to a computer for verification. However, it is much less common to use a computer to actively look for a discharging proof. In this paper, we use a Linear Programming approach to automatically look for a discharging proof. While our system is not entirely autonomous, we manage to make some progress towards Wegner's conjecture for distance-$2$ coloring of planar graphs, by showing that $12$ colors are sufficie…
A recent lower bound on the number of edges in a k-critical n-vertex graph by Kostochka and Yancey yields a half-page proof of the celebrated Grötzsch Theorem that every planar triangle-free graph is 3-colorable. In this paper we use the same bound to give short proofs of other known theorems on 3-coloring of planar graphs, among whose is the Grünbaum-Aksenov Theorem that every planar with at most three triangles is 3-colorable. We also prove the new result that every graph obtained from a triangle-free planar graph by adding a vertex of degree at most four is 3-colorable.
Based on the algorithmic proof of Lovász local lemma due to Moser and Tardos, the works of Grytczuk et al. on words, and Dujmović et al. on colorings, Esperet and Parreau developed a framework to prove upper bounds for several chromatic numbers (in particular acyclic chromatic index, star chromatic number and Thue chromatic number) using the so-called \emph{entropy compression method}. Inspired by this work, we propose a more general framework and a better analysis. This leads to improved upper bounds on chromatic numbers and indices. In particular, every graph with maximum degree $Δ$ has an a…
In this paper, we obtain polynomial time algorithms to determine the acyclic chromatic number, the star chromatic number, the Thue chromatic number, the harmonious chromatic number and the clique chromatic number of $P_4$-tidy graphs and $(q,q-4)$-graphs, for every fixed $q$. These classes include cographs, $P_4$-sparse and $P_4$-lite graphs. All these coloring problems are known to be NP-hard for general graphs. These algorithms are fixed parameter tractable on the parameter $q(G)$, which is the minimum $q$ such that $G$ is a $(q,q-4)$-graph. We also prove that every connected $(q,q-4)$-graph…
A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once. It is known that the list edge chromatic number $χ'_l(G)$ of any outer-1-planar graph $G$ with maximum degree $Δ(G)\geq 5$ is exactly its maximum degree. In this paper, we prove $χ'_l(G)=Δ(G)$ for outer-1-planar graphs $G$ with $Δ(G)=4$ and with the crossing distance being at least 3.
We study Koebe orderings of planar graphs: vertex orderings obtained by modelling the graph as the intersection graph of pairwise internally-disjoint discs in the plane, and ordering the vertices by non-increasing radii of the associated discs. We prove that for every $d\in \mathbb{N}$, any such ordering has $d$-admissibility bounded by $O(d/\ln d)$ and weak $d$-coloring number bounded by $O(d^4 \ln d)$. This in particular shows that the $d$-admissibility of planar graphs is bounded by $O(d/\ln d)$, which asymptotically matches a known lower bound due to Dvořák and Siebertz.
Given a graph $G$ and a list assignment $L(v)$ for each vertex of $v$ of $G$. A proper $L$-list-coloring of $G$ is a function that maps every vertex to a color in $L(v)$ such that no pair of adjacent vertices have the same color. We say that a graph is list $k$-colorable when every vertex $v$ has a list of colors of size at least $k$. A $2$-distance coloring is a coloring where vertices at distance at most 2 cannot share the same color. We prove the existence of a $2$-distance list ($Δ+2$)-coloring for planar graphs with girth at least $10$ and maximum degree $Δ\geq 4$.
An incidence of a graph $G$ is a vertex-edge pair $(v,e)$ such that $v$ is incidence with $e$. A conflict-free incidence coloring of a graph is a coloring of the incidences in such a way that two incidences $(u,e)$ and $(v,f)$ get distinct colors if and only if they conflict each other, i.e.,(i) $u=v$, (ii) $uv$ is $e$ or $f$, or (iii) there is a vertex $w$ such that $uw=e$ and $vw=f$. The minimum number of colors used among all conflict-free incidence colorings of a graph is the conflict-free incidence chromatic number. A graph is outer-1-planar if it can be drawn in the plane so that vertice…
We answer positively the question of Albertson asking whether every planar graph can be $5$-list-colored even if it contains precolored vertices, as long as they are sufficiently far apart from each other. In order to prove this claim, we also give bounds on the sizes of graphs critical with respect to 5-list coloring. In particular, if G is a planar graph, H is a connected subgraph of G and L is an assignment of lists of colors to the vertices of G such that |L(v)| >= 5 for every v in V(G)-V(H) and G is not L-colorable, then G contains a subgraph with O(|H|^2) vertices that is not L-colorable…
Grotzsch's theorem states that every triangle-free planar graph is 3-colorable. Several relatively simple proofs of this fact were provided by Thomassen and other authors. It is easy to convert these proofs into quadratic-time algorithms to find a 3-coloring, but it is not clear how to find such a coloring in linear time (Kowalik used a nontrivial data structure to construct an O(n log n) algorithm). We design a linear-time algorithm to find a 3-coloring of a given triangle-free planar graph. The algorithm avoids using any complex data structures, which makes it easy to implement. As a by-prod…
In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs of vertices with near colors imply the edge between them is present and pairs of vertices with far colors imply the edge is absent. Not all planar graphs are threshold-colorable, but several subclasses, such as trees, some planar grids, and planar graphs without short cycles can always be threshold-colored. Using these results we obtain unit-cube contact representation of several subclasses of planar graphs. Variant…
We prove the existence of a function $f :\mathbb{N} \to \mathbb{N}$ such that the vertices of every planar graph with maximum degree $Δ$ can be 3-colored in such a way that each monochromatic component has at most $f(Δ)$ vertices. This is best possible (the number of colors cannot be reduced and the dependence on the maximum degree cannot be avoided) and answers a question raised by Kleinberg, Motwani, Raghavan, and Venkatasubramanian in 1997. Our result extends to graphs of bounded genus.
We consider the problem of list edge coloring for planar graphs. Edge coloring is the problem of coloring the edges while ensuring that two edges that are incident receive different colors. A graph is k-edge-choosable if for any assignment of k colors to every edge, there is an edge coloring such that the color of every edge belongs to its color assignment. Vizing conjectured in 1965 that every graph is (D+1)-edge-choosable, where D is the maximum degree. In 1990, Borodin solved the conjecture for planar graphs with maximum degree at least 9, and asked whether the bound could be lowered to 8. …
The Weisfeiler-Leman (WL) algorithm is a combinatorial procedure that computes colorings on graphs, which can often be used to detect their (non-)isomorphism. Particularly the 1- and 2-dimensional versions 1-WL and 2-WL have received much attention, due to their numerous links to other areas of computer science. Knowing the expressive power of a certain dimension of the algorithm usually amounts to understanding the computed colorings. An increase in the dimension leads to finer computed colorings and, thus, more graphs can be distinguished. For example, on the class of planar graphs, 3-WL sol…
Recently, Borodin, Kostochka, and Yancey (On $1$-improper $2$-coloring of sparse graphs. Discrete Mathematics, 313(22), 2013) showed that the vertices of each planar graph of girth at least $7$ can be $2$-colored so that each color class induces a subgraph of a matching. We prove that any planar graph of girth at least $6$ admits a vertex coloring in $2$ colors such that each monochromatic component is a path of length at most $14$. Moreover, we show a list version of this result. On the other hand, for each positive integer $t\geq 3$, we construct a planar graph of girth $4$ such that in any …
Let G be a plane graph with outer cycle C, let u,v be vertices of C and let (L(x):x in V(G)) be a family of sets such that |L(u)|=|L(v)|=2, L(x) has at least three elements for every vertex x of C-{u,v} and L(x) has at least five elements for every vertex x of G-V(C). We prove a conjecture of Hutchinson that G has a (proper) coloring f such that f(x) belongs to L(x) for every vertex x of G. We will use this as a lemma in subsequent papers.
We denote by $χ$ g (G) the game chromatic number of a graph G, which is the smallest number of colors Alice needs to win the coloring game on G. We know from Montassier et al. [M. Montassier, P. Ossona de Mendez, A. Raspaud and X. Zhu, Decomposing a graph into forests, J. Graph Theory Ser. B, 102(1):38-52, 2012] and, independantly, from Wang and Zhang, [Y. Wang and Q. Zhang. Decomposing a planar graph with girth at least 8 into a forest and a matching, Discrete Maths, 311:844-849, 2011] that planar graphs with girth at least 8 have game chromatic number at most 5. One can ask if this bound of …
Given a graph $G$, and a spanning subgraph $H$ of $G$, a circular $q$-backbone $k$-coloring of $(G,H)$ is a proper $k$-coloring $c$ of $G$ such that $q\le \lvert c(u)-c(v)\rvert \le k-q$, for every edge $uv\in E(H)$. The circular $q$-backbone chromatic number of $(G,H)$, denoted by $CBC_q(G,H)$, is the minimum integer $k$ for which there exists a circular $q$-backbone $k$-coloring of $(G,H)$. The Four Color Theorem implies that whenever $G$ is planar, we have $CBC_2(G,H)\le 8$. It is conjectured that this upper bound can be improved to 7 when $H$ is a tree, and to 6 when $H$ is a matching. In …
Total coloring is a variant of edge coloring where both vertices and edges are to be colored. A graph is totally $k$-choosable if for any list assignment of $k$ colors to each vertex and each edge, we can extract a proper total coloring. In this setting, a graph of maximum degree $Δ$ needs at least $Δ+1$ colors. In the planar case, Borodin proved in 1989 that $Δ+2$ colors suffice when $Δ$ is at least 9. We show that this bound also holds when $Δ$ is $8$.
For planar graphs, we consider the problems of \emph{list edge coloring} and \emph{list total coloring}. Edge coloring is the problem of coloring the edges while ensuring that two edges that are adjacent receive different colors. Total coloring is the problem of coloring the edges and the vertices while ensuring that two edges that are adjacent, two vertices that are adjacent, or a vertex and an edge that are incident receive different colors. In their list extensions, instead of having the same set of colors for the whole graph, every vertex or edge is assigned some set of colors and has to b…
