Publication:4501549
From MaRDI portal
zbMath0982.05050MaRDI QIDQ4501549
Ton Kloks, Richard B. Tan, Hans L. Bodlaender, Jan van Leeuwen
Publication date: 8 April 2002
68Q25: Analysis of algorithms and problem complexity
05C15: Coloring of graphs and hypergraphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Graph distance‐dependent labeling related to code assignment in computer networks, On distance constrained labeling of disk graphs, Algorithms for graphs with small octopus, Theory of computational complexity. Part 7. Transl. from the Russian, A bound on the chromatic number of the square of a planar graph, Radiocoloring in planar graphs: Complexity and approximations, Systems of pairs of \(q\)-distant representatives, and graph colorings