Finding the chromatic number by means of critical graphs
From MaRDI portal
Publication:5463425
DOI10.1145/944618.944628zbMath1083.68649OpenAlexW2058048384MaRDI QIDQ5463425
Francine Herrmann, Alain Hertz
Publication date: 4 August 2005
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: http://www.jea.acm.org/2002/HerrmannChromatic/
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
On edge orienting methods for graph coloring, An exact algorithm with learning for the graph coloring problem, Solution techniques for the large set covering problem, Complexity of Coloring Random Graphs, An exact approach for the vertex coloring problem, Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable, The general \(\alpha \)-decomposition problem of fuzzy relations, A semidefinite programming-based heuristic for graph coloring, Coloring graphs by iterated local search traversing feasible and infeasible solutions, Efficient algorithms for finding critical subgraphs, Variable space search for graph coloring, Embedding a novel objective function in a two-phased local search for robust vertex coloring, An exact method for graph coloring
