Widths of links via diagram colorings

In this paper, we define invariants of links in terms of colorings of link diagrams and prove that these invariants coincide with various notions of widths of links with respect to the standard Morse function. Our formulations are advantageous because they are algorithmic and suitable for program implementations. As an application, we calculate the max-width of over 10000 links up to 14 crossings from the link table.