Bounds on spectrum graph coloring

DOI10.1016/J.ENDM.2016.09.012MaRDI QIDQ510538zbMATH OpenOpenAlexFDO

Authors David Orden, Ivan Marsa-Maestre, Jose Manuel Gimenez-Guzman, Enrique de la Hoz

Publication date 13 February 2017

Full work available at URL http://hdl.handle.net/10017/26759

zbMATH Keywords

chromatic spectrum coloringDSATURfrequency assignmentgraph coloringthreshold spectrum coloringWiFi channel assignment

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Spectrum graph coloring and applications to Wi-Fi channel assignment
• Bounds for the frequency assignment problem
• On the use of some known methods for \(T\)-colorings of graphs
• Graph coloring bounds for cellular radio
• Weighted Improper Colouring

Cites work

• A survey on vertex coloring problems
• Graph labellings with variable weights, a survey
• Models and solution techniques for frequency assignment problems
• Reducibility among combinatorial problems
• Weighted improper colouring

Cited in

(5)

• Spectrum graph coloring and applications to Wi-Fi channel assignment
• Contrast in greyscales of graphs
• scientific article; zbMATH DE number 29786 (Why is no real title available?)
• scientific article; zbMATH DE number 2079419 (Why is no real title available?)
• Minimum gradation in greyscales of graphs

Describes a project that uses

Uses Software

• CALMA

This page was built for publication: Bounds on spectrum graph coloring

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