Injective coloring of planar graphs

A coloring of a graph G is injective if its restriction to the neighborhood of any vertex is injective. The injective chromatic numberχ_i(G) of a graph G is the least k such that there is an injective k-coloring. In this paper we prove that if G is a planar graph with girth g and maximum degree Δ, then (1) χ_i(G)=Δ if either g≥20 and Δ≥3, or g≥7 and Δ≥71; (2) χ_i(G)≤Δ+1 if g≥11; (3) χ_i(G)≤Δ+2 if g≥8.     

List coloring triangle-free planar graphs

This paper proves the following result. Assume $G$ is a triangle-free planar graph, $X$ is an independent set of $G$. If $L$ is a list assignment of $G$ such that $\text{◂=▸}|L\left(v\right)|=4$ for each vertex $\text{◂+▸}v\in V\left(G\right)-X$ and $\text{◂=▸}|L\left(v\right)|=3$ for each vertex $v\in X$, then $G$ is $L$-colorable.     

Star coloring bipartite planar graphs

A star coloring of a graph is a proper vertex‐coloring such that no path on four vertices is 2‐colored. We prove that the vertices of every bipartite planar graph can be star colored from lists of size 14, and we give an example of a bipartite planar graph that requires at least eight colors to star color. © 2008 Wiley Periodicals, Inc. J Graph Theory 60: 1–10, 2009     

Improved square coloring of planar graphs

Square coloring is a variant of graph coloring where vertices within distance two must receive different colors. When considering planar graphs, the most famous conjecture (Wegner, 1977) states that $\frac{3}{2}\mathrm{\Delta }+1$ colors are sufficient to square color every planar graph of maximum degree Δ. This conjecture has been proven asymptotically for graphs with large maximum degree. We consider here planar graphs with small maximum degree and show that $2\mathrm{\Delta }+7$ colors are sufficient, which improves the best known bounds when $6?\mathrm{\Delta }?31$.     

Backbone coloring for triangle-free planar graphs

Acta Mathematicae Applicatae Sinica, English Series - Let G be a graph and H a subgraph of G. A backbone-k-coloring of (G, H) is a mapping f: V(G) → {1, 2, ···, k} such that...     

Equitable defective coloring of sparse planar graphs

A graph has an equitable, defective $k$-coloring (an ED-$k$-coloring) if there is a $k$-coloring of $V\left(G\right)$ that is defective (every vertex shares the same color with at most one neighbor) and equitable (the sizes of all color classes differ by at most one). A graph may have an ED-$k$-coloring, but no ED-$(k+1)$-coloring. In this paper, we prove that planar graphs with minimum degree at least $2$ and girth at least $10$ are ED-$k$-colorable for any integer $k\ge 3$. The proof uses the method of discharging. We are able to simplify the normally lengthy task of enumerating forbidden substructures by using Hall’s Theorem, an unusual approach.     

Star coloring planar graphs from small lists

A star coloring of a graph is a proper vertex‐coloring such that no path on four vertices is 2‐colored. We prove that the vertices of every planar graph of girth 6 (respectively 7, 8) can be star colored from lists of size 8 (respectively 7, 6). We give an example of a planar graph of girth 5 that requires 6 colors to star color. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 324–337, 2010     

Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs

A graph is 2-outerplanar if it has a planar embedding such that the subgraph obtained by removing the vertices of the external face is outerplanar (i.e. with all its vertices on the external face). An oriented k-coloring of an oriented graph G is a homomorphism from G to an oriented graph H of order k. We prove that (1) every oriented triangle-free planar graph has an oriented chromatic number at most 40, and (2) every oriented 2-outerplanar graph has an oriented chromatic number at most 40, that improves the previous known bounds of 47 and 67, respectively.     

Linear coloring of planar graphs with large girth

A proper vertex coloring of a graph G is linear if the graph induced by the vertices of any two color classes is the union of vertex-disjoint paths. The linear chromatic number of the graph G is the smallest number of colors in a linear coloring of G. In this paper we prove that every planar graph G with girth g and maximum degree Δ has if G satisfies one of the following four conditions: (1) g≥13 and Δ≥3; (2) g≥11 and Δ≥5; (3) g≥9 and Δ≥7; (4) g≥7 and Δ≥13. Moreover, we give better upper bounds of linear chromatic number for planar graphs with girth 5 or 6.     

Injective coloring of planar graphs with girth 5

A coloring of a graph G is injective if its restriction to the neighbour of any vertex is injective. The injective chromatic number X_i\left(G\right) of a graph G is the leastk such that there is an injective k-coloring. In this paper, we prove that for each planar graph with g\ge 5 and \Delta \left(G\right)\ge 20, {\chi }_i\left(G\right)\le \Delta \left(G\right)+3.     

A note on list improper coloring planar graphs

A graph G is called (k, d)^*-choosable if, for every list assignment L satisfying |L(v)| = k for all v ϵ V(G), there is an L-coloring of G such that each vertex of G has at most d neighbors colored with the same color as itself. In this note, we prove that every planar graph without 4-cycles and l-cycles for some l ϵ {5, 6, 7} is (3, 1)^*-choosable.     

没有4-圈的平面图的BB-染色

设H为G的一个生成子图,(G,H)的一个BB-k染色是指一个映射f:V(G)→{1,2…,k},满足以下两条:(i)|f(u)-f(u)|≥1,uu∈E(G)\E(H).(ii)|f(u)-f(u)|≥2,uv∈E(H).定义(G,H)的BB-色数xb(G,H)为最小的整数k,使得(G,H)是BB-k可染的.本文证明了...     

Total coloring of planar graphs without chordal 7-cycles

A k-total-coloring of a graph G is a coloring of vertices and edges of G using k colors such that no two adjacent or incident elements receive the same color.In this paper,it is proved that if G is a planar graph with Δ(G) ≥ 7 and without chordal 7-cycles,then G has a(Δ(G) + 1)-total-coloring.