Related papers: 3-coloring triangle-free planar graphs with a prec…
This paper proves that if $G$ is a planar graph without 4-cycles and $l$-cycles for some $l\in\{5, 6, 7\}$, then there exists a matching $M$ such that $AT(G-M)\leq 3$. This implies that every planar graph without 4-cycles and $l$-cycles for…
Let G be a 4-critical graph with t triangles, embedded in a surface of genus g. Let c be the number of 4-cycles in G that do not bound a 2-cell face. We prove that the sum of lengths of (>=5)-faces of G is at most linear in g+t+c-1.
A total $k$-coloring of a graph is an assignment of $k$ colors to its vertices and edges such that no two adjacent or incident elements receive the same color. The Total Coloring Conjecture (TCC) states that every simple graph $G$ has a…
In this paper, we give a polynomial time algorithm which determines if a given graph containing a triangle and no induced seven-vertex path is 3-colorable, and gives an explicit coloring if one exists. In previous work, we gave a polynomial…
It is known that DP-coloring is a generalization of a list coloring in simple graphs and many results in list coloring can be generalized in those of DP-coloring. In this work, we introduce a relaxed DP-coloring which is a generalization if…
In this paper, we prove that the class of graphs with no triangle and no induced cycle of even length at least 6 has bounded chromatic number. It is well-known that even-hole-free graphs are $\chi$-bounded but we allow here the existence of…
A graph is {\em near-bipartite} if its vertex set can be partitioned into an independent set and a set that induces a forest. It is clear that near-bipartite graphs are $3$-colorable. In this note, we show that planar graphs without cycles…
The question of whether 3-Coloring can be solved in polynomial-time for the diameter two graphs is a well-known open problem in the area of algorithmic graph theory. We study the problem restricted to graph classes that avoid cycles of…
In this paper, graphs under consideration are always edge-colored. We consider long heterochromatic paths in heterochromatic triangle free graphs. Two kinds of such graphs are considered, one is complete graphs with Gallai colorings, i.e.,…
A graph is $P_t$-free if it contains no induced subgraph isomorphic to a $t$-vertex path. A graph is not bipartite if and only if it contains an induced subgraph isomorphic to a $k$-vertex cycle, where $k$ is odd. We focus on the 3-coloring…
The chromatic number of an planar graph is not greater than four and this is known by the famous four color theorem and is equal to two when the planar graph is bipartite. When the planar graph is even-triangulated or all cycles are greater…
A list assignment of a graph $G$ is a function $L$ that assigns a list $L(v)$ of colors to each vertex $v\in V(G)$. An $(L,d)^*$-coloring is a mapping $\pi$ that assigns a color $\pi(v)\in L(v)$ to each vertex $v\in V(G)$ so that at most…
Let $C$ be a cycle and $f : V(C) \rightarrow \{c_1,c_2,\ldots,c_k\}$ a proper $k$-colouring of $C$ for some $k \ge 4$. We say the colouring $f$ is safe if for any planar graph $G$ in which $C$ is an induced cycle, there exists a proper…
Dvo\v{r}\'ak, Kr\'al' and Thomas gave a description of the structure of triangle-free graphs on surfaces with respect to 3-coloring. Their description however contains two substructures (both related to graphs embedded in plane with two…
A planar graph can be embedded in a piecewise linear manifold, and the lattice on each linear piece can be colored with 3-coloring. If a planar graph can be colored with multiple 3-coloring, i.e. coloring the graph in pieces with different…
A generalization of list-coloring, now known as DP-coloring, was recently introduced by Dvo\v{r}\'{a}k and Postle. Essentially, DP-coloring assigns an arbitrary matching between lists of colors at adjacent vertices, as opposed to only…
DP-coloring is a generalization of list coloring, which was introduced by Dvo\v{r}\'{a}k and Postle [J. Combin. Theory Ser. B 129 (2018) 38--54]. Zhang [Inform. Process. Lett. 113 (9) (2013) 354--356] showed that every planar graph with…
We introduce a new variant of graph coloring called correspondence coloring which generalizes list coloring and allows for reductions previously only possible for ordinary coloring. Using this tool, we prove that excluding cycles of lengths…
We prove that every planar triangle-free graph on $n$ vertices has fractional chromatic number at most $3-\frac{1}{n+1/3}$.
We study choosability with separation which is a constrained version of list coloring of graphs. A (k,d)-list assignment L on a graph G is a function that assigns to each vertex v a list L(v) of at least k colors and for any adjacent pair…