Some sequential graph colouring algorithms

DOI10.1080/00207218908921070zbMath0728.68062OpenAlexW2018458434MaRDI QIDQ3352500

Sipra Sen Sarma, Samir Kumar Bandyopadhyay

Publication date: 1989

Published in: International Journal of Electronics (Search for Journal in Brave)

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

zbMATH Keywords

graph colouring algorithms

Mathematics Subject Classification ID

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

Related Items (2)

A systematic study on meta-heuristic approaches for solving the graph coloring problem ⋮ An exact method for graph coloring

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How To Color Claw-Free Perfect Graphs
• Compactness and balancing in scheduling
• New methods to color the vertices of a graph
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Chromatic Scheduling and the Chromatic Number Problem

This page was built for publication: Some sequential graph colouring algorithms