## Abstract

All planar graphs are 4-colorable and 5-choosable, while some planar graphs are not 4-choosable. Determining which properties guarantee that a planar graph can be colored using lists of size four has received significant attention. In terms of constraining the structure of the graph, for any \(\ell \in \{3,4,5,6,7\}\), a planar graph is 4-choosable if it is \(\ell \)-cycle-free. In terms of constraining the list assignment, one refinement of *k*-choosability is *choosability with separation*. A graph is *(k, s)-choosable* if the graph is colorable from lists of size *k* where adjacent vertices have at most *s* common colors in their lists. Every planar graph is (4, 1)-choosable, but there exist planar graphs that are not (4, 3)-choosable. It is an open question whether planar graphs are always (4, 2)-choosable. A *chorded*
\(\ell \)-*cycle* is an \(\ell \)-cycle with one additional edge. We demonstrate for each \(\ell \in \{5,6,7\}\) that a planar graph is (4, 2)-choosable if it does not contain chorded \(\ell \)-cycles.

This is a preview of subscription content, access via your institution.

## References

- 1.
Alon, N., Tarsi, M.: Colorings and Orientations of Graphs. Combinatorica

**12**(2), 125–134 (1992). doi:10.1007/BF01204715 - 2.
Borodin, O.V.: Colorings of Plane Graphs: A Survey. Discret. Math.

**313**(4), 517–539 (2013). doi:10.1016/j.disc.2012.11.011 - 3.
Borodin, O.V., Ivanova, A.O.: Planar Graphs Without Triangular 4-Cycles are 4-Choosable. Sib. Élektron. Mat. Izv.

**5**, 75–79 (2008) - 4.
Choi, I., Lidický, B., Stolee, D.: On Choosability with Separation of Planar Graphs with Forbidden Cycles. J. Graph Theory

**81**(3), 283–306 (2016). doi:10.1002/jgt.21875 - 5.
Cranston, D.W., West, D.B.: An Introduction to the Discharging Method via Graph Coloring. Discret. Math.

**340**(4), 766–793 (2017). doi:10.1016/j.disc.2016.11.022 - 6.
Farzad, B.: Planar Graphs Without 7-Cycles are 4-Choosable. SIAM J. Discret. Math.

**23**(3), 1179–1199 (2009). doi:10.1137/05064477X - 7.
Fijavž, G., Juvan, M., Mohar, B., Škrekovski, R.: Planar Graphs Without Cycles of Specific Lengths. Eur. J. Combin.

**23**(4), 377–388 (2002). doi:10.1006/eujc.2002.0570 - 8.
Kierstead, H.A., Lidický, B.: On Choosability with Separation of Planar Graphs with Lists of Different Sizes. Discrete Math.

**338**(10), 1779–1783 (2015). doi:10.1016/j.disc.2015.01.008 - 9.
Kratochvíl, J., Tuza, Z., Voigt, M.: Brooks-type Theorems for Choosability with Separation. J. Graph Theory

**27**(1), 43–49 (1998). doi:10.1002/(SICI)1097-0118(199801)27:1<43::AID-JGT7>3.3.CO;2-Q - 10.
Lam, P.C.B., Xu, B., Liu, J.: The \(4\)-Choosability of Plane Graphs Without \(4\)-Cycles. J. Combin. Theory Ser. B

**76**(1), 117–126 (1999). doi:10.1006/jctb.1998.1893 - 11.
Thomassen, C.: Every Planar Graph is \(5\)-Choosable. J. Combin. Theory Ser. B

**62**(1), 180–181 (1994). doi:10.1006/jctb.1994.1062 - 12.
Voigt, M.: List Colourings of Planar Graphs. Discret. Math.

**120**(1–3), 215–219 (1993). doi:10.1016/0012-365X(93)90579-I - 13.
Škrekovski, R.: A Note on Choosability with Separation for Planar Graphs. Ars Combin.

**58**, 169–174 (2001) - 14.
Wang, W., Lih, K.W.: Choosability and Edge Choosability Of Planar Graphs Without Five Cycles. Appl. Math. Lett.

**15**(5), 561–565 (2002). doi:10.1016/S0893-9659(02)80007-6 - 15.
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)

## Acknowledgements

We are grateful to anonymous referee for spotting mistakes in the previous version of the manuscript. We thank Ryan R. Martin, Alex Nowak, Alex Schulte, and Shanise Walker for participation in the early stages of the Project.

## Author information

### Affiliations

### Corresponding author

## Additional information

Supported by NSF Grants DMS-1266016 and DMS-1600390.

## Appendix: Large Reducible Configurations

### Appendix: Large Reducible Configurations

In the proof of Theorem 8, we demonstrated that no minimal counterexample exists by showing that there exists a reducible configuration \((C,X,{\text {ex}})\) where *G* contains a copy of *C*[*X*] as an induced subgraph (and also the copy agrees with the external degrees). In this appendix, we provide the details that clarify this assumption. By Lemma 1, we can relax the condition that *C*[*X*] is an induced subgraph. We will demonstrate that the configurations that appear after some vertices in *X* are merged (while also preserving the face lengths, vertex degrees, and lack of chorded 5-cycle) result in reducible configurations.

Let \((C,X, {\text {ex}})\) be a reducible configuration and let \(\{x_1,x_1'\},\dots ,\{x_t,x_t'\}\) be a list of vertex pairs in *X*. For these configurations, we may identify some 3-cycles and 5-cycles that are required to be 5-faces (in the context of the proof of Theorem 8). The resulting configuration \((C',X',{\text {ex}})\) where \(C'\) and \(X'\) are modified from *C* and *X* by merging \(x_i\) with \(x_i'\) and removing any multiedges or loops that result. We say a list \(\{x_1,x_1'\},\dots ,\{x_t,x_t'\}\) is *valid* for \((C,X,{\text {ex}})\) if the resulting configuration \((C',X',{\text {ex}})\) may appear in a planar graph of minimum degree at least four containing no chorded 5-cycle. There are three situations that can occur when we perform this action.

*Pairs too close:* If some pair \(\{x_i, x_i'\}\) have \(d(x_i,x_i') \le 2\), then either we create a loop or a multiedge when merging \(x_i\) and \(x_i'\). This will reduce the degree of the resulting vertex, in addition to possibly shortening known 3- and 5-cycles. Since distances only decrease as vertices are merged, a pair failing this property will not appear in any valid list of pairs.

*Pairs creating chord* If merging \(x_i\) and \(x_i'\) creates a chorded 5-cycle, then this configuration would not appear in the minimal counterexample from Theorem 8. Since distances only decrease as vertices are merged, a pair failing this property will not appear in any valid list of pairs.

*Reducible pairs* If merging \(x_i\) and \(x_i'\) does not fit in the above two cases, then we will demonstrate that the resulting configuration is reducible. Even if merging one pair of vertices creates a reducible configuration, we need to check all possible lists of pairs that contain that pair.

After considering all pairs that could be identified, observe that in each case there is no set of three or more vertices where every pair can be identified.

In the following tables, we list one of the configurations (C10)–(C21), label the vertices, and list all pairs of vertices into the three categories above. In the case of reducible pairs, we present the contracted graph. Most of these contracted graphs contain a copy of (C1), (C2), (C10), (C11), or (C12). The only exceptions are the contracted graphs derived from (C16), but each of these configurations has an Alon–Tarsi orientation and hence is reducible.

## Rights and permissions

## About this article

### Cite this article

Berikkyzy, Z., Cox, C., Dairyko, M. *et al.* (4, 2)-Choosability of Planar Graphs with Forbidden Structures.
*Graphs and Combinatorics* **33, **751–787 (2017). https://doi.org/10.1007/s00373-017-1812-5

Received:

Revised:

Published:

Issue Date:

### Keywords

- Graph coloring
- Planar graph
- Choosability with separation
- Discharging