Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemerédi, Endre (2011) Partitioning 3-colored complete graphs into three monochromatic cycles. ELECTRONIC JOURNAL OF COMBINATORICS, 18. ISSN 1077-8926

Full text not available from this repository.

Item Type:	ISI Article
Uncontrolled Keywords:	PATHS, VERTEX COVERINGS
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:	EPrints Admin
Date Deposited:	12 Dec 2012 08:40
Last Modified:	05 Feb 2014 15:48
URI:	https://eprints.sztaki.hu/id/eprint/6581

Update Item