Graph coloring bounds for cellular radio

DOI10.1016/0898-1221(90)90361-MMaRDI QIDQ1262873zbMATH OpenOpenAlexFDO

Authors Pierre Baldi, Edward C. Posner

Publication date 1990

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0898-1221(90)90361-m

zbMATH Keywords

graph coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Communication theory (94A05) Applications of graph theory to circuits and networks (94C15)

Recommendations

• On a generalized family of colorings
• scientific article; zbMATH DE number 1008460
• Frequency assignment in cellular phone networks
• scientific article; zbMATH DE number 1990841
• scientific article; zbMATH DE number 4065018

Cited in

(6)

• A Technique for Estimating the Minimum Number of Frequencies Required for Urban Mobile Radio Communication
• scientific article; zbMATH DE number 1990841 (Why is no real title available?)
• Channel assignment and weighted coloring
• Graph radio coloring concepts
• Bounds on spectrum graph coloring
• On a generalized family of colorings

This page was built for publication: Graph coloring bounds for cellular radio

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