Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings

DOI10.1137/050623061zbMath1129.05043OpenAlexW2034105403WikidataQ57601530 ScholiaQ57601530MaRDI QIDQ3440271

Martin Tancer, Riste Škrekovski, Daniel Král'

Publication date: 22 May 2007

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050623061

zbMATH Keywords

channel assignment problem\(L(21)\)-labeling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (6)

An extremal problem on non-full colorable graphs ⋮ Hole: An Emerging Character in the Story of Radio k-Coloring Problem ⋮ Path covering number and \(L(2,1)\)-labeling number of graphs ⋮ On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs ⋮ A note on \(L (2, 1)\)-labelling of trees ⋮ On island sequences of labelings with a condition at distance two

This page was built for publication: Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings