4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
From MaRDI portal
Publication:2685332
DOI10.1016/j.disc.2022.113298OpenAlexW4313594542MaRDI QIDQ2685332
Fan Yang, Yue Wang, Jian Liang Wu
Publication date: 21 February 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.03938
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Steinberg's conjecture is false
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- List colourings of planar graphs
- Planar graphs without cycles of specific lengths
- A non-3-choosable planar graph without cycles of length 4 and 5
- Colorings and orientations of graphs
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- The 4-choosability of plane graphs without 4-cycles
- Every planar graph is 5-choosable
- Choosability and edge choosability of planar graphs without five cycles
- On structure of some plane graphs with application to choosability
- 3-list-coloring planar graphs of girth 5
- A not 3-choosable planar graph without 3-cycles
- 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart
- Planar Graphs without 7-Cycles Are 4-Choosable
- Combinatorial Nullstellensatz
- Brooks-type theorems for choosability with separation
- Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
- List coloring with requests
This page was built for publication: 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
