## Graphs and Digraphs, 2nd Edition

- G. Chartrand, L. Lesniak
- No graph is perfect. Amer. Math. Monthly
- 1967

A graph G is pluperfect if one can add new multiple edges to obtain a multi graph M satisfying: (1) G spans M, (2) the degrees of the nodes of M are consecutive integers, (3) G and M have the same minimum degree. Our purpose is to display several families of pluperfect graphs in order to L Introduction My good friends Mehdi Behzad and Gary Chartrand wrote a… (More)