Labelings of Graphs with Fixed and Variable Edge-Weights

DOI10.1137/040619545MaRDI QIDQ3519202zbMATH OpenOpenAlexWikidataFDO

Authors Robert Babilon, Vít Jelínek, Pavel Valtr, Daniel Král'

Publication date 13 August 2008

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

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

zbMATH Keywords

channel assignment problemgraph labeling with distance conditions

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• The Channel Assignment Problem with Variable Weights
• Publication:4944992
• The \(L(j,k)\)-edge-labeling problem on graphs.
• Edge span of \(L(d,1)\)-labeling on some graphs
• The $L(2,1)$-Labeling Problem on Graphs

Cited in

(4)

• The Channel Assignment Problem with Variable Weights
• Graph labellings with variable weights, a survey
• Randomly colouring graphs (a combinatorial view)
• \(\lambda\)-edge span of some almost regular graphs

This page was built for publication: Labelings of Graphs with Fixed and Variable Edge-Weights

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