scientific article; zbMATH DE number 2044507

MaRDI QIDQ4448371zbMATH OpenFDO

Authors 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

Mathematics Subject Classification ID

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

Recommendations

• Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
• Distance Constrained Labelings of Trees
• Fixed-parameter complexity of \(\lambda\)-labelings
• scientific article; zbMATH DE number 1420920
• Linear and cyclic distance-three labellings of trees

Cited in

(14)

• -backbone colorings along pairwise disjoint stars and matchings
• Systems of distant representatives
• Theory of computational complexity. Part 7. Transl. from the Russian
• L(p,q) labeling of d-dimensional grids
• Systems of pairs of \(q\)-distant representatives, and graph colorings
• Radio graceful Hamming graphs
• Distance Constrained Labelings of Trees
• Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
• Distance three labelings of trees
• More relations between -labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
• Fixed-parameter complexity of \(\lambda\)-labelings
• Linear and cyclic distance-three labellings of trees
• List version of L(d,s)-labelings
• The \(L(h,1,1)\)-labelling problem for trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4448371)