On the chromatic number of graphs
From MaRDI portal
Publication:5942344
DOI10.1023/A:1017557620292zbMath0977.05054OpenAlexW2111989082MaRDI QIDQ5942344
Sergiy I. Butenko, Paola Festa, Panos M. Pardalos
Publication date: 28 August 2001
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1017557620292
Programming involving graphs or networks (90C35) Integer programming (90C10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Design of highly synchronizable and robust networks ⋮ Constructing test functions for global optimization using continuous formulations of graph problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some experiments with simulated annealing for coloring graphs
- An introduction to timetabling
- A collection of test problems for constrained global optimization algorithms
- Generating quadratic assignment test problems with known optimal permutations
- Test case generators and computational results for the maximum clique problem
- Generation of large-scale quadratic programs for use as global optimization test problems
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- A graph coloring algorithm for large scheduling problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- The Complexity of Near-Optimal Graph Coloring
- New methods to color the vertices of a graph
- A test problem generator for the Steiner problem in graphs
- Networks and vehicle routing for municipal waste collection
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- A technique for colouring a graph applicable to large scale timetabling problems
- Perfect Graphs and an Application to Optimizing Municipal Services
This page was built for publication: On the chromatic number of graphs
