A note on additive choice number of planar graphs

DOI10.1016/J.DAM.2022.07.010zbMath1497.05238OpenAlexW4297677790MaRDI QIDQ2172418

Ko-Wei Lih, Hsin-Hao Lai

Publication date: 15 September 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.07.010

zbMATH Keywords

planar graphadditive coloringadditive choice numberadditive chromatic number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• A note on adjacent vertex distinguishing colorings of graphs
• Additive coloring of planar graphs
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
• Lucky labelings of graphs
• On the lucky choice number of graphs
• Additive list coloring of planar graphs with given girth
• Planar graphs with girth 20 are additively 3-choosable
• Local antimagic labeling of graphs
• Regular Graphs of Odd Degree Are Antimagic
• Antimagic Labeling of Regular Graphs
• Coloring the square of a planar graph

This page was built for publication: A note on additive choice number of planar graphs