An approximate algorithm for the chromatic number of graphs

DOI10.1016/j.endm.2014.08.013zbMath1337.05104OpenAlexW2024831296MaRDI QIDQ283679

Guillermo de Ita Luna, J. Raymundo Marcial-Romero, Yolanda Moyao

Publication date: 13 May 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2014.08.013

zbMATH Keywords

approximation algorithmgraph coloringchromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

New algorithm for calculating chromatic index of graphs and its applications

Cites Work

• Unnamed Item
• Algorithmic graph theory and perfect graphs
• 3-coloring in time
• Graphs, Algorithms, and Optimization

This page was built for publication: An approximate algorithm for the chromatic number of graphs