An approximate chromatic number of a graph

DOI10.1080/09720529.2008.10698198zbMATH Open1206.05042OpenAlexW1968360451MaRDI QIDQ3078472

Dǎnuţ Marcu

Publication date: 28 February 2011

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2008.10698198

zbMATH Keywords

algorithmcomputer programchromatic numberfinite graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Related Items (1)

New approximation guarantee for chromatic number

This page was built for publication: An approximate chromatic number of a graph

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