Reducing graph coloring to clique search
From MaRDI portal
Publication:326946
zbMath1348.05084MaRDI QIDQ326946
Publication date: 12 October 2016
Published in: Asia Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: http://apjm.apacific.org/PDFs/3-1-64-85.pdf
edge coloring; independent set; clique; 2-fold coloring; 3-clique free coloring; clique search algorithm vertex coloring; greedy coloring algorithm
05C15: Coloring of graphs and hypergraphs
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact algorithm for the maximum clique problem
- An algorithm for finding a maximum clique in a graph
- Test case generators and computational results for the maximum clique problem
- A fast algorithm for the maximum clique problem
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
- Greedy algorithms for triangle free coloring
- Finding near-optimal independent sets at scale
- Graph Theory and Probability
- New methods to color the vertices of a graph
- Sur le coloriage des graphs