Additive list coloring of planar graphs with given girth
From MaRDI portal
Publication:2175242
Recommendations
Cites work
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- A note on adjacent vertex distinguishing colorings of graphs
- A short list color proof of Grötzsch's theorem
- Additive coloring of planar graphs
- Algorithmic complexity of proper labeling problems
- An introduction to the discharging method via graph coloring
- Combinatorial Nullstellensatz
- Computation of lucky number of planar graphs is NP-hard
- Edge weights and vertex colours
- I,F-partitions of sparse graphs
- Lucky labelings of graphs
- On the lucky choice number of graphs
- Planar Ramsey numbers
- Spanning trees with specified differences in Cayley graphs
- Star coloring of sparse graphs
- The inapproximability for the \((0,1)\)-additive number
- The sigma chromatic number of a graph
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
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)