On the additive chromatic number of several families of graphs

DOI10.1016/j.ipl.2020.105937zbMath1436.05041arXiv1602.07675OpenAlexW2286805858MaRDI QIDQ2308457

Daniel Severín

Publication date: 3 April 2020

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.07675

zbMATH Keywords

graph algorithmslucky labelingadditive chromatic numberadditive coloring conjecture

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Computation of lucky number of planar graphs is NP-hard
• Topological additive numbering of directed acyclic graphs
• Additive coloring of planar graphs
• Lucky labelings of graphs
• On the lucky choice number of graphs
• Additive list coloring of planar graphs with given girth

This page was built for publication: On the additive chromatic number of several families of graphs