Tough enough chordal graphs are Hamiltonian

Chen, G. and Jacobson, MS and Kézdy, AE and Lehel, Jenő (1998) Tough enough chordal graphs are Hamiltonian. NETWORKS, 31. pp. 29-38.

Full text not available from this repository.
Item Type: Article
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Depositing User: Eszter Nagy
Date Deposited: 11 Dec 2012 14:54
Last Modified: 11 Dec 2012 14:54

Update Item Update Item