Greedy algorithms for triangle free coloring
From MaRDI portal
Publication:1927697
zbMath1262.05063MaRDI QIDQ1927697
Publication date: 2 January 2013
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
independent set; clique; vertex coloring; maximum clique; greedy coloring; clique search algorithm; \(s\)-clique free coloring; \(s\)-clique free set; satisfiability solver
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Reducing graph coloring to clique search, Decomposing clique search problems into smaller instances based on node and edge colorings, Numerical experiments with LP formulations of the maximum clique problem