New upper bounds for the greatest number of proper colorings of a (V,E)‐graph

This publication has 7 references indexed in Scilit:

• On the greatest number of 2 and 3 colorings of a (v, e)‐graph
  Journal of Graph Theory, 1989
• A theoretical analysis of backtracking in the graph coloring problem
  Journal of Algorithms, 1985
• Backtrack: An O(1) expected time algorithm for the graph coloring problem
  Information Processing Letters, 1984
• Problemes Extremaux Concernant le Nombre Des Colorations des Sommets D’un Graphe Fini
  Published by Springer Nature ,1975
• Counting Coloured Graphs. III
  Canadian Journal of Mathematics, 1972
• A logical expansion in mathematics
  Bulletin of the American Mathematical Society, 1932
• A Determinant Formula for the Number of Ways of Coloring a Map
  Annals of Mathematics, 1912