Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
1
0
3
Closed neighborhoods in planar graphs can be taught with at most two non-clashing examples, resolving a long-standing conjecture, yet distinguishing between one and two teaching examples is NP-hard.