scientific article; zbMATH DE number 1998817

MaRDI QIDQ4433447zbMATH OpenFDO

Authors Marek Kubale, K. Manuszewski

Publication date 1996

zbMATH Keywords

computational complexitygraph coloring algorithmpolynomial-time approximation algorithmspseudorandom graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• An approximate algorithm for the chromatic number of graphs
• Algorithmic bounds for the chromatic number†
• scientific article; zbMATH DE number 4087683
• An effective heuristic algorithm for sum coloring of graphs
• New Algorithm for Chromatic Number of Graphs and their Applications
• An algorithm to determine the chromatic number of a graph
• Polynomial algorithm for finding chromatic sum for unicyclic and outerplanar graphs.
• scientific article; zbMATH DE number 4021171
• Graph colouring algorithms
• New algorithm for the sum coloring problem

Cited in

(5)

• On chromatic sums and distributed resource allocation
• scientific article; zbMATH DE number 1234485 (Why is no real title available?)
• scientific article; zbMATH DE number 1947053 (Why is no real title available?)
• New Algorithm for Chromatic Number of Graphs and their Applications
• On sum coloring and sum multi-coloring for restricted families of graphs

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 Q4433447)