scientific article; zbMATH DE number 3873389

MaRDI QIDQ3340907zbMATH OpenFDO

Authors M. Cozzens, Ding-I Wang

Publication date 1984

zbMATH Keywords

channel assignment problemT-coloringnested graphsradio frequency assignment problem

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 3853101
• An Asymptotic Approach to the Channel Assignment Problem
• \(T\)-graphs and the channel assignment problem
• \(T\)-colorings of graphs: recent results and open problems
• Bounds for the frequency assignment problem

Cited in

(16)

• List \(T\)-colorings of graphs
• Bounds for the frequency assignment problem
• Radio channel assignment on 2-dimensional lattices
• \(T\)-colorings of graphs: recent results and open problems
• scientific article; zbMATH DE number 3853101 (Why is no real title available?)
• Channel assignment on Cayley graphs
• Channel assignment with large demands
• scientific article; zbMATH DE number 1990680 (Why is no real title available?)
• A doubly cyclic channel assignment problem
• \(T\)-graphs and the channel assignment problem
• \(T\)-coloring of certain networks
• scientific article; zbMATH DE number 1944137 (Why is no real title available?)
• Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube
• The channel assignment problem for mutually adjacent sites
• scientific article; zbMATH DE number 15260 (Why is no real title available?)
• A Theorem about the Channel Assignment Problem

This page was built for publication:

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