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

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

Authors Riste Škrekovski, Martin Tancer, 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)

Recommendations

• On the Structure of Graphs with Non-Surjective L(2,1)-Labelings
• scientific article; zbMATH DE number 5763155
• A note on collections of graphs with non-surjective lambda labelings
• Griggs and Yeh's conjecture and \(L(p,1)\)-labelings
• scientific article; zbMATH DE number 2091962

Cited in

(9)

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

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)