Search - IFIP Open Digital Library

1 Array

hal_authIdPerson_i : 1011792

	For these 1 documents Send to ORCID RSS ATOM Export BibTeX XML-TEI CSV RTF EndNote PDF HTML Advanced export	Page :	sorted by Relevance Author A→Z Author Z→A Title A→Z Title Z→A Increasing publication date Decreasing publication date Increasing deposit date Decreasing deposit date

		The Algorithmic Complexity of k-Domatic Partition of Graphs Hongyu Liang 7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. pp.240-249, ⟨10.1007/978-3-642-33475-7_17⟩ Conference papers hal-01556216v1	Send to ORCID Export BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Advanced export Share Gmail Facebook X LinkedIn More