Choosability with union separation of planar graphs without intersecting triangles

DOI10.1016/J.AMC.2025.129493MaRDI QIDQ6922191zbMATH OpenFDO

Authors Xinhong Pang, Min Chen

Publication date 2 October 2025

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AMC.2025.129493

zbMATH Keywords

\((k,k+s)\)-choosablechoosability with union separationintersecting trianglesplanar graph

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX)

Cites work

• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
• Choosability with union separation
• Choosability with union separation of planar graphs without cycles of length 4
• Choosability with union separation of triangle-free planar graphs
• Every planar graph is 5-choosable
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• List colourings of planar graphs
• On \((3, r)\)-choosability of some planar graphs

This page was built for publication: Choosability with union separation of planar graphs without intersecting triangles

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