Computing large matchings fast
The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs