Topological additive numbering of directed acyclic graphs
DOI10.1016/j.ipl.2014.09.011zbMath1304.05119arXiv1310.4141OpenAlexW2052876314MaRDI QIDQ477623
Javier Marenco, Daniel Severín, Marcelo Mydlarz
Publication date: 9 December 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.4141
computational complexitydirected acyclic graphslucky labelingadditive coloringtopological additive numbering
Extremal problems in graph theory (05C35) Integer programming (90C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20)
Related Items
Cites Work