• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph.

Alain HertzHadrien MélotSébastien BonteGauvain DevillezPierre Hauweele
Published in: Graphs Comb. (2023)
Keyphrases
  • upper bound
  • small number
  • error probability
  • computational complexity
  • lower bound
  • graph theoretic
  • special case
  • constraint programming
  • finite number
  • graph model