New Algorithm for Chromatic Number of Graphs and their Applications

DOI10.21608/JOEMS.2018.3353.1076MaRDI QIDQ5220289zbMATH OpenOpenAlexFDO

Authors

Publication date 16 March 2020

Published in Journal of the Egyptian Mathematical Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.21608/joems.2018.3353.1076

zbMATH Keywords

adjacency matrixchromatic numbervertex-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Graph theory (05C99)

Recommendations

• New algorithm for calculating chromatic index of graphs and its applications
• New bounds for the chromatic number of graphs
• An approximate algorithm for the chromatic number of graphs
• scientific article; zbMATH DE number 3904612
• New upper bounds for the chromatic number of a graph
• New approximation algorithms for graph coloring
• New graph coloring algorithms
• scientific article; zbMATH DE number 4179402
• scientific article; zbMATH DE number 1998817
• A new vertex coloring heuristic and corresponding chromatic number

Cited in

(6)

• A new algorithmic method to compute the chromatic number of dihedral group
• New algorithm for calculating chromatic index of graphs and its applications
• An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem
• An algorithm to determine the chromatic number of a graph
• scientific article; zbMATH DE number 1998817 (Why is no real title available?)
• Finding the chromatic number by means of critical graphs

This page was built for publication: New Algorithm for Chromatic Number of Graphs and their Applications

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