scientific article; zbMATH DE number 1751952

MaRDI QIDQ4533083zbMATH OpenFDO

Authors Manouchehr Zaker

Publication date 19 November 2002

zbMATH Keywords

coloringsNP-completeness

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Greedy \(T\)-colorings of graphs
• Greedy \(F\)-colorings of graphs
• scientific article; zbMATH DE number 2159638
• New approximation algorithms for graph coloring
• New graph coloring algorithms
• scientific article; zbMATH DE number 1341914
• New results about set colorings of graphs
• New challenges in the theory of hypergraph coloring
• A new kind of graph coloring
• scientific article; zbMATH DE number 227553

Cited in

(4)

• Greedy defining sets in graphs and Latin squares
• scientific article; zbMATH DE number 3906523 (Why is no real title available?)
• scientific article; zbMATH DE number 1341914 (Why is no real title available?)
• More results on greedy defining sets.

This page was built for publication:

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