Some sequential graph colouring algorithms

DOI10.1080/00207218908921070MaRDI QIDQ3352500zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Numerical experiences with graph coloring algorithms
• scientific article; zbMATH DE number 4134072
• scientific article; zbMATH DE number 3841898
• scientific article; zbMATH DE number 4187836
• New graph coloring algorithms

Cites work

• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Chromatic Scheduling and the Chromatic Number Problem
• Compactness and balancing in scheduling
• Graph theory with applications
• How To Color Claw-Free Perfect Graphs
• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• scientific article; zbMATH DE number 3446921 (Why is no real title available?)
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• scientific article; zbMATH DE number 3383914 (Why is no real title available?)
• New methods to color the vertices of a graph

Cited in

(17)

• Numerical experiences with graph coloring algorithms
• Sequential coloring versus Welsh-Powell bound
• Hard-to-color graphs for connected sequential colorings
• The smallest hard-to-color graph for the SL algorithm
• An incremental search heuristic for coloring vertices of a graph
• An exact method for graph coloring
• A systematic study on meta-heuristic approaches for solving the graph coloring problem
• A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
• Graph colouring algorithms
• Graph Coloring Using Eigenvalue Decomposition
• scientific article; zbMATH DE number 3841898 (Why is no real title available?)
• New graph coloring algorithms
• Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem
• scientific article; zbMATH DE number 1743833 (Why is no real title available?)
• scientific article; zbMATH DE number 3894489 (Why is no real title available?)
• On the recursive largest first algorithm for graph colouring
• scientific article; zbMATH DE number 4187836 (Why is no real title available?)

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

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