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

DOI10.1016/J.DISC.2022.113298MaRDI QIDQ2685332zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

choosableCombinatorial Nullstellensatznice pathplanar graphs

Mathematics Subject Classification ID

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

Recommendations

• Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable
• The 4-choosability of plane graphs without 4-cycles
• 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart
• Planar graphs without intersecting 5-cycles are 4-choosable
• Planar graphs without 4-cycles adjacent to triangles are 4-choosable

Cites work

• 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart
• 3-list-coloring planar graphs of girth 5
• A non-3-choosable planar graph without cycles of length 4 and 5
• A not 3-choosable planar graph without 3-cycles
• Brooks-type theorems for choosability with separation
• Choosability and edge choosability of planar graphs without five cycles
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• Colorings and orientations of graphs
• Combinatorial Nullstellensatz
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Every planar graph is 5-choosable
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 3563170 (Why is no real title available?)
• List coloring with requests
• List colourings of planar graphs
• On structure of some plane graphs with application to choosability
• Planar Graphs without 7-Cycles Are 4-Choosable
• Planar graphs without cycles of specific lengths
• Steinberg's conjecture is false
• The 4-choosability of planar graphs without 6-cycles
• The 4-choosability of plane graphs without 4-cycles

Cited in

(6)

• The 4-choosability of planar graphs and cycle adjacency
• \((4,2)\)-choosability of planar graphs with forbidden structures
• (4,1)^*-choosability of planar graphs
• 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
• Minimal abundant packings and choosability with separation
• Flexibility of planar graphs without C₄ and C₅

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2685332)