scientific article; zbMATH DE number 2044507

zbMath1042.68545MaRDI QIDQ4448371

Jiří Fiala, Jan Kratochvíl, Andrzej Proskurowski

Publication date: 18 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2202/22020285.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (12)

\(L(p,q)\) labeling of \(d\)-dimensional grids ⋮ Radio graceful Hamming graphs ⋮ Distance Constrained Labelings of Trees ⋮ Distance three labelings of trees ⋮ Unnamed Item ⋮ Systems of distant representatives ⋮ The \(L(h,1,1)\)-labelling problem for trees ⋮ Theory of computational complexity. Part 7. Transl. from the Russian ⋮ Linear and cyclic distance-three labellings of trees ⋮ \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings ⋮ Systems of pairs of \(q\)-distant representatives, and graph colorings ⋮ List version of \(L(d,s)\)-labelings

This page was built for publication: