Additive list coloring of planar graphs with given girth

DOI10.7151/dmgt.2156zbMath1439.05198OpenAlexW2893580622WikidataQ129189899 ScholiaQ129189899MaRDI QIDQ2175242

Jennifer White, Sogol Jahanbekam, Axel Brandt

Publication date: 28 April 2020

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

Full work available at URL: https://doi.org/10.7151/dmgt.2156

zbMATH Keywords

combinatorial nullstellensatzdischarging methodlucky labelingreducible configurationadditive coloring

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) Signed and weighted graphs (05C22)

Related Items (2)

A note on additive choice number of planar graphs ⋮ On the additive chromatic number of several families of graphs

Cites Work

• Unnamed Item
• A note on adjacent vertex distinguishing colorings of graphs
• I,F-partitions of sparse graphs
• Algorithmic complexity of proper labeling problems
• Computation of lucky number of planar graphs is NP-hard
• Spanning trees with specified differences in Cayley graphs
• An introduction to the discharging method via graph coloring
• The sigma chromatic number of a graph
• Additive coloring of planar graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Lucky labelings of graphs
• Planar Ramsey numbers
• A short list color proof of Grötzsch's theorem
• Edge weights and vertex colours
• On the lucky choice number of graphs
• The inapproximability for the (0,1)-additive number
• Star coloring of sparse graphs
• Combinatorial Nullstellensatz

This page was built for publication: Additive list coloring of planar graphs with given girth