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

Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph.

Alain HertzHadrien MélotSébastien BonteGauvain Devillez
Published in: Discret. Appl. Math. (2023)
Keyphrases
  • lower bound
  • upper bound
  • small number
  • computational complexity
  • social networks
  • np hard
  • linear programming
  • graph theory