Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs

DOI10.1007/s10878-018-0255-0zbMath1418.90237OpenAlexW2788798419MaRDI QIDQ1752619

Wensong Lin, Chenli Shen

Publication date: 24 May 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0255-0

zbMATH Keywords

triangular latticecomplete graphsquare latticechannel assignment problemodd cycle\(L(j_1, j_2, \dots, j_m)\)-labeling number\(n\)-fold \(L(j_1, j_2, \dots, j_m)\)-labeling number\(n\)-fold \(t\)-separated consecutive \(L(j_1, j_2, \dots, j_m)\)-labeling number

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• \(k\)-fold coloring of planar graphs
• On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
• Multicoloring and Mycielski construction
• n-tuple colorings and associated graphs
• \(n\)-tuple coloring of planar graphs with large odd girth
• Graph multi-coloring for a job scheduling application
• On optimal \(k\)-fold colorings of webs and antiwebs
• Multiple \(L(j,1)\)-labeling of the triangular lattice
• Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
• A survey on labeling graphs with a condition at distance two
• Multiple Coloring of Cone Graphs
• Multi-coloring the Mycielskian of graphs
• Labelling Graphs with a Condition at Distance 2
• Two Results Concerning Multicoloring
• Graph labeling and radio channel assignment
• Multichromatic numbers, star chromatic numbers and Kneser graphs

This page was built for publication: Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs