"3-Connected {K 1, 3, P 9}-Free Graphs are Hamiltonian-Connected."

Qiuju Bian et al. (2014)

Details and statistics

DOI: 10.1007/S00373-013-1344-6

access: closed

type: Journal Article

metadata version: 2020-06-04

a service of  Schloss Dagstuhl - Leibniz Center for Informatics