The delunification process and minimal diagrams

For each number of crossings through 16, we list the lune-free diagrams and we color them. If the number of colors equals the corresponding lower bound we know we have a minimum number of colors. We also introduce and list the lune-free crossing number of a link i.e., the minimum number of crossings needed for a lune-free diagram of this link, and other related link invariants.