Anna Kirkpatrick

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We discuss the problem of finding critical sets in graphs, a concept which has appeared in a number of guises in the combinatorics and graph theory literature. The case of the Sudoku graph receives particular attention, because critical sets correspond to minimal fair puzzles. We define four parameters associated with the sizes of extremal critical sets and(More)
  • 1