Tomescu's Graph Coloring Conjecture for ℓ-Connected Graphs.
John EngbersAysel EreyJacob FoxXiaoyu HePublished in: SIAM J. Discret. Math. (2021)
Keyphrases
- graph coloring
- connected graphs
- combinatorial problems
- job shop scheduling
- phase transition
- np complete problems
- constraint satisfaction problems
- scheduling problem
- max sat
- closed form
- markov random field
- traveling salesman problem
- constraint satisfaction
- constraint programming
- distributed constraint optimization problems
- higher order
- job shop scheduling problem
- upper bound
- bin packing
- artificial bee colony
- neural network
- metaheuristic