Bounds on spectrum graph coloring

DOI10.1016/j.endm.2016.09.012zbMath1356.05053OpenAlexW2536254817MaRDI QIDQ510538

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

graph coloringfrequency assignmentDSATURchromatic spectrum coloringthreshold spectrum coloringWiFi channel assignment

Mathematics Subject Classification ID

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

Related Items (2)

Minimum gradation in greyscales of graphs ⋮ Contrast in greyscales of graphs

Uses Software

• CALMA

Cites Work

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

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