Algorithmic bounds for the chromatic number†

DOI10.1080/02331930701779021zbMATH Open1133.05033OpenAlexW2015792287MaRDI QIDQ5449019FDOQ5449019

Authors: Ingo Schiermeyer 

Publication date: 10 March 2008

Published in: Optimization (Search for Journal in Brave)

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

Recommendations

• An approximate algorithm for the chromatic number of graphs
• New upper bounds for the chromatic number of a graph
• scientific article; zbMATH DE number 1189240
• An upper bound for the chromatic number of line graphs
• Bounds for the chromatic number of a graph

zbMATH Keywords

algorithmgraph colouring

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Graph Theory and Probability
• On Brooks' Theorem for Sparse Graphs
• The strong perfect graph theorem
• Recognizing Berge graphs
• Title not available (Why is that?)
• Three short proofs in graph theory
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Vertex colouring and forbidden subgraphs -- a survey
• A strengthening of Brooks' theorem
• The smallest triangle-free 4-chromatic 4-regular graph
• New upper bounds for the chromatic number of a graph

Cited In (18)

• New upper bounds for the chromatic number of a graph
• Graph coloring approach with new upper bounds for the chromatic number: team building application
• Algorithmic discrepancy beyond partial coloring
• Title not available (Why is that?)
• Efficient bounds on a branch and bound algorithm for graph colouration
• Title not available (Why is that?)
• On the hardness of approximating the chromatic number
• An approximate algorithm for the chromatic number of graphs
• An algorithm to determine the chromatic number of a graph
• The chromatic discrepancy of graphs
• A bound on the total chromatic number
• Exact Algorithms for a One-defective Vertex Colouring Problem
• Title not available (Why is that?)
• Three new upper bounds on the chromatic number
• Bounds for the chromatic number of a graph
• Improved bounds for the chromatic number of a graph
• Bounded vertex colorings of graphs
• Efficient algorithms for finding critical subgraphs

This page was built for publication: Algorithmic bounds for the chromatic number†

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