e/Overfull graph

Information
has gloss	eng: In graph theory, an overfull graph is a graph whose size is greater than the product of its maximum degree and its order floored, i.e. m > \Delta (G) \lfloor n/2 \rfloor where m is the size of G, \displaystyle\Delta(G) is the maximum degree of G, and n is the order of G. The concept of an overfull subgraph, an overfull graph that is a subgraph, immediately follows. An alternate, stricter definition of an overfull subgraph S of a graph G requires \displaystyle\Delta (G) = \Delta (S).
lexicalization	eng: overfull graph
instance of	c/Graph families