The exhibit hall at the National Council of Teachers of Mathematics annual meeting was filled with instructional materials claiming alignment to the common core.

A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof.

We investigate graphs with the property that all longest paths or all longest cycles have empty intersection. In this paper, we find such graphs as subgraphs of cubic lattices. Bulletin Mathématique ...