Reducing graph coloring to clique search

zbMath1348.05084MaRDI QIDQ326946

Bogdán Zaválnij, Sándor Szabó

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

zbMATH Keywords

edge coloringindependent setclique2-fold coloring3-clique free coloringclique search algorithm vertex coloringgreedy coloring algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Reducing hypergraph coloring to clique search

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reducing graph coloring to clique search