Additive list coloring of planar graphs with given girth
DOI10.7151/DMGT.2156zbMATH Open1439.05198OpenAlexW2893580622WikidataQ129189899 ScholiaQ129189899MaRDI QIDQ2175242FDOQ2175242
Authors: Axel Brandt, Sogol Jahanbekam, Jennifer White
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
Recommendations
combinatorial nullstellensatzdischarging methodlucky labelingreducible configurationadditive coloring
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Edge weights and vertex colours
- A note on adjacent vertex distinguishing colorings of graphs
- Title not available (Why is that?)
- Additive coloring of planar graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Lucky labelings of graphs
- Combinatorial Nullstellensatz
- A short list color proof of Grötzsch's theorem
- I,F-partitions of sparse graphs
- Star coloring of sparse graphs
- Algorithmic complexity of proper labeling problems
- Computation of lucky number of planar graphs is NP-hard
- On the lucky choice number of graphs
- Spanning trees with specified differences in Cayley graphs
- The sigma chromatic number of a graph
- Planar Ramsey numbers
- An introduction to the discharging method via graph coloring
- The inapproximability for the \((0,1)\)-additive number
Cited In (7)
- On the additive chromatic number of several families of graphs
- Additive coloring of planar graphs
- The inapproximability for the \((0,1)\)-additive number
- A note on additive choice number of planar graphs
- Planar graphs with girth 20 are additively 3-choosable
- An alternative approach for bounding the additive choice number of planar graphs
- An Alon-Tarsi style theorem for additive colorings
This page was built for publication: Additive list coloring of planar graphs with given girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175242)