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

DOI10.1007/S40840-021-01218-4MaRDI QIDQ2117577zbMATH OpenOpenAlexFDO

Authors Heng Li, Hongguo Zhu, Jianfeng 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)

Recommendations

• Choosability with union separation of planar graphs without cycles of length 4
• Choosability with union separation of triangle-free planar graphs
• On choosability with separation of planar graphs with forbidden cycles
• On choosability with separation of planar graphs without adjacent short cycles
• A sufficient condition for planar graphs to be (3,1)-choosable

Cites work

• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• 3-list-coloring planar graphs of girth 5
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• Choosability with union separation
• Choosability with union separation of triangle-free planar graphs
• Colorings and orientations of graphs
• Every planar graph is 5-choosable
• Every planar graph without adjacent cycles of length at most 8 is 3-choosable
• List coloring triangle-free planar graphs
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
• On choosability with separation of planar graphs without adjacent short cycles
• Planar graphs without intersecting 5-cycles are 4-choosable
• The 4-choosability of plane graphs without 4-cycles

Cited in

(9)

• scientific article; zbMATH DE number 5914884 (Why is no real title available?)
• scientific article; zbMATH DE number 6873968 (Why is no real title available?)
• Choosability with union separation of triangle-free planar graphs
• scientific article; zbMATH DE number 5116037 (Why is no real title available?)
• scientific article; zbMATH DE number 5064026 (Why is no real title available?)
• A note on 3-choosability of planar graphs related to Montanssier's conjecture
• Choosability with union separation of planar graphs without cycles of length 4
• On \(( 2 , r )\)-choosability of planar graphs without short cycles
• ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS

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

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