On the 2-Dimensional Channel Assignment Problem

DOI10.1109/TC.1984.5009310MaRDI QIDQ3309078zbMATH OpenOpenAlexFDO

Authors

Publication date 1984

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.1984.5009310

zbMATH Keywords

2-dimensional channel assignmentgraph coloringNP-completenessrectangle intersection graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(2)

• Interval graphs and related topics
• Inverse chromatic number problems in interval and permutation graphs

This page was built for publication: On the 2-Dimensional Channel Assignment Problem

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