On Interference Graphs

DOI10.1016/j.endm.2009.03.016zbMath1267.05235OpenAlexW2062472810MaRDI QIDQ2839250

V. Yegnanarayanan, V. Thamaraiselvi

Publication date: 4 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.03.016

zbMATH Keywords

graphs2-coloringfrequency assignment problemradio labelinginterference graphs

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• Lower bounding techniques for frequency assignment
• Corrigendum: Static frequency assignment in cellular networks
• Bounds for the frequency assignment problem
• Competitive call control in mobile networks
• On the hardness of approximating minimization problems
• The Traveling Salesman Problem with Distances One and Two

This page was built for publication: On Interference Graphs