mathematics Conjecture: A graph G with Δ ( G ) > n / 3 {\displaystyle \Delta (G)>n/3} is class 2 if and only if it has an overfull subgraph S such that Δ...

EMS Press, 2001 [1994] Niessen, Thomas (1994), "How to find overfull subgraphs in graphs with large maximum degree", Discrete Applied Mathematics, 51...

coloring conjecture: for every graph, the list chromatic index equals the chromatic index The overfull conjecture that a graph with maximum degree Δ ( G )...

possible for class 2 planar graphs. The overfull subgraph conjecture of A. J. W. Hilton, stating that graphs with degree at least n/3 are either of class...

set R into one page S, and if the S is overfull, repeatedly split until none of the resulting pages are overfull. Replace the set R of regions in page...

Consumers are adequately buying all products put into the marketplace. Overfull demand — More consumers would like to buy the product than can be satisfied...