On \((3, r)\)-choosability of some planar graphs

DOI10.1007/s40840-021-01218-4zbMath1485.05062OpenAlexW4206560000MaRDI QIDQ2117577

Heng Li, Hongguo Zhu, Jian-Feng Hou

Publication date: 21 March 2022

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-021-01218-4

zbMATH Keywords

triangleplanar graphchorded cyclechoosability with union separation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On choosability with separation of planar graphs without adjacent short cycles
• Colorings and orientations of graphs
• The 4-choosability of plane graphs without 4-cycles
• Every planar graph is 5-choosable
• Choosability with union separation
• 3-list-coloring planar graphs of girth 5
• Choosability with union separation of triangle-free planar graphs
• Every planar graph without adjacent cycles of length at most 8 is 3-choosable
• Planar graphs without intersecting 5-cycles are 4-choosable
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• List coloring triangle‐free planar graphs

This page was built for publication: On \((3, r)\)-choosability of some planar graphs