"1-Tough cocomparability graphs are hamiltonian."

Jitender S. Deogun, Dieter Kratsch, George Steiner (1997)

Details and statistics

DOI: 10.1016/0012-365X(95)00359-5

access: open

type: Journal Article

metadata version: 2021-02-12

a service of  Schloss Dagstuhl - Leibniz Center for Informatics