$4$-choosability of planar graphs with $4$-cycles far apart via the Combinatorial Nullstellensatz

DOI10.1016/j.disc.2022.113298zbMath1509.05059arXiv2211.03938MaRDI QIDQ6416458

Jian Liang Wu, Unnamed Author, Fan Yang

Publication date: 7 November 2022

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: $4$-choosability of planar graphs with $4$-cycles far apart via the Combinatorial Nullstellensatz