Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits

Y. Daniel Liang, Norbert Blum. Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits. Inf. Process. Lett., 56(4):215-219, 1995. [doi]

Abstract

Abstract is missing.