Many years later, as a graduate student at Princeton University, she helped solve a long-standing question in a mathematical field called graph theory ... graphs, called Berge graphs and perfect ...

Perfect graphs are, by definition, colorable with the most limited palette possible. When coloring a graph, every node in a mutually connected cluster, or “clique,” must receive a distinct color, so ...

Maria Chudnovsky studies mathematical objects called graphs, which consist of dots and lines ... a conjecture stating that there is always a simple reason why a graph is not perfect. The conjecture ...

However, generalizing from graphs to hypergraphs quickly gets complicated. One way to illustrate this is to consider the canonical cut problem from graph theory, which asks: Given two distinct nod ...

It also has direct and crucial implications for a branch of mathematics known as graph theory. These graphs consist of collections of points, or vertices, that may (or may not) be connected to each ...

Like something straight from a thriller or the TV show "24," mathematicians have figured out a model to describe the perfect ... a complicated graph technique called lattice theory, the ...

KALAMAZOO, Mich.—Western Michigan University's international reputation on the topic of graph theory is on display in a new book published recently by Princeton University Press. Graph theory, a ...