A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof. Four years ago, the mathematician Maria Chudnovsky faced an all-too ...

Whether presenting a project at school, delivering a critical report at work, or simply trying to make sense of your budget, graphs are efficient and visually appealing means of conveying complex ...

Four years ago, the mathematician Maria Chudnovsky faced an all-too-common predicament: how to seat 120 wedding guests, some of whom did not get along, at a dozen or so conflict-free tables. Luckily, ...

Cayley graphs, constructed from the algebraic structure of groups, provide a natural framework for exploring complex combinatorial properties. In these graphs, vertices represent group elements and ...

Perold, André, V. Chvatal, R. L. Graham, and S. Whitesides. "Combinatorial Designs Related to the Strong Perfect Graph Conjecture." Discrete Mathematics 26, no. 2 ...