Experts disagree about how close the researchers have come to a perfect graph coloring theorem. In Vušković’s opinion, “The square-free case of perfect graphs retains all the structural complexity of ...

It was in 2002 that Chudnovsky along with Seymour, then her Ph.D. advisor, and two more collaborators proved the “strong perfect graph theorem” establishing what it takes to be a perfect graph.

Facebook's Graph Search will impact your business page (or personal one) in ways you don't intend. Ari Melber at the Huffington Post penned a stark reminder in his post: Why Graph Search Could Be ...

Bhaswar B. Bhattacharya, COLLISION TIMES IN MULTICOLOR URN MODELS AND SEQUENTIAL GRAPH COLORING WITH APPLICATIONS TO DISCRETE LOGARITHMS, The Annals of Applied Probability, Vol. 26, No. 6 (December ...