New Algorithm for Chromatic Number of Graphs and their Applications

DOI10.21608/JOEMS.2018.3353.1076zbMATH Open1435.05086OpenAlexW2914422792MaRDI QIDQ5220289

Author name not available (Why is that?)

Publication date: 16 March 2020

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

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

zbMATH Keywords

adjacency matrixchromatic numbervertex-coloring

Mathematics Subject Classification ID

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

Related Items (1)

Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• An approximate algorithm for the chromatic number of graphs 👍 👎
• A new vertex coloring heuristic and corresponding chromatic number 👍 👎
• New algorithm for calculating chromatic index of graphs and its applications 👍 👎
• New upper bounds for the chromatic number of a graph 👍 👎
• New bounds for the chromatic number of graphs 👍 👎
• New approximation algorithms for graph coloring 👍 👎

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)