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

A sharp lower bound on the number of non-equivalent colorings of graphs of order and maximum degree.

Romain AbsilEglantine CambyAlain HertzHadrien Mélot
Published in: Discret. Appl. Math. (2018)
Keyphrases