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

DOI10.1137/050623061zbMATH Open1129.05043OpenAlexW2034105403WikidataQ57601530 ScholiaQ57601530MaRDI QIDQ3440271FDOQ3440271

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)

Cited In (9)

• Path covering number and \(L(2,1)\)-labeling number of graphs
• On island sequences of labelings with a condition at distance two
• A note on \(L (2, 1)\)-labelling of trees
• A note on collections of graphs with non-surjective lambda labelings
• An extremal problem on non-full colorable graphs
• On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs
• Constructing graphs with no immersion of large complete graphs
• Hole: An Emerging Character in the Story of Radio k-Coloring Problem
• On the Structure of Graphs with Non-Surjective L(2,1)-Labelings

   Recommendations

• On the Structure of Graphs with Non-Surjective L(2,1)-Labelings 👍 👎
• Title not available (Why is that?) 👍 👎
• A note on collections of graphs with non-surjective lambda labelings 👍 👎
• Griggs and Yeh's conjecture and \(L(p,1)\)-labelings 👍 👎
• Title not available (Why is that?) 👍 👎

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

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