"Every 3-connected, locally connected, claw-free graph is Hamilton-connected."

Armen S. Asratian (1996)

Details and statistics

DOI: 10.1002/(SICI)1097-0118(199610)23:2<191::AID-JGT10>3.0.CO;2-K

access: closed

type: Journal Article

metadata version: 2020-10-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics