Monochromatic path covers in nearly complete graphs

Gyárfás, András and Jagota, A. and Schelp, RH (1997) Monochromatic path covers in nearly complete graphs. THE JOURNAL of COMBINATORIAL MATHEMATICS and COMBINATORIAL COMPUTING, 25. pp. 129-144.

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:53
Last Modified: 11 Dec 2012 14:53
URI: http://eprints.sztaki.hu/id/eprint/1264

Update Item Update Item