An approximation chromatic number of a graph

DOI10.1080/09720529.2008.10698198zbMATH Open1206.05042OpenAlexW1968360451MaRDI QIDQ3078472FDOQ3078472

Authors: 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

Recommendations

• An approximate algorithm for the chromatic number of graphs
• scientific article; zbMATH DE number 5859
• scientific article; zbMATH DE number 4134072
• An improved algorithm for approximating the chromatic number of \(G_{n,p}\)
• scientific article; zbMATH DE number 3906523

zbMATH Keywords

algorithmchromatic numberfinite graphscomputer program

Mathematics Subject Classification ID

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

Cites Work

• Graph theory with applications

Cited In (5)

• An approximate algorithm for the chromatic number of graphs
• New approximation guarantee for chromatic number
• Title not available (Why is that?)
• An algorithm to determine the chromatic number of a graph
• On the chromatic number of graphs

This page was built for publication: An approximation 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)