Proper additive choice number of planar graphs

DOI10.7151/DMGT.2601MaRDI QIDQ6866019zbMATH OpenFDO

Authors Hsin-Hao Lai, Cheng-Lin Tsou, Yi-Hsuan Huang, Yu-Jhan Su

Publication date 30 January 2026

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2601

zbMATH Keywords

combinatorial nullstellensatzdischarging methodplanar graphproper additive choice numberproper additive chromatic numberproper additive coloring

Mathematics Subject Classification ID

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

Cites work

• 2-distance coloring of sparse graphs
• A note on additive choice number of planar graphs
• A note on adjacent vertex distinguishing colorings of graphs
• Additive coloring of planar graphs
• Additive list coloring of planar graphs with given girth
• An introduction to the discharging method via graph coloring
• Coloring the square of a planar graph
• Colorings and orientations of graphs
• Combinatorial Nullstellensatz
• List strong edge coloring of some classes of graphs
• Lucky labelings of graphs
• On the lucky choice number of graphs
• Planar graphs with girth 20 are additively 3-choosable
• Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\)
• The inapproximability for the (0,1)-additive number
• The sigma chromatic number of a graph

This page was built for publication: Proper additive choice number of planar graphs

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