Full metadata record
DC FieldValueLanguage
dc.contributor.authorFu, HLen_US
dc.contributor.authorHu, WHen_US
dc.date.accessioned2014-12-08T15:44:17Z-
dc.date.available2014-12-08T15:44:17Z-
dc.date.issued2001-01-06en_US
dc.identifier.issn0012-365Xen_US
dc.identifier.urihttp://hdl.handle.net/11536/29904-
dc.description.abstractIn this note, we prove that the ascending subgraph decomposition conjecture is true for complete multipartite graphs. (C) 2001 Elsevier Science B.V. All rights reserved. MSG: 05C70.en_US
dc.language.isoen_USen_US
dc.subjectascending subgraph decompositionsen_US
dc.subjectmultipartite graphsen_US
dc.titleA note on ascending subgraph decompositions of complete multipartite graphsen_US
dc.typeArticleen_US
dc.identifier.journalDISCRETE MATHEMATICSen_US
dc.citation.volume226en_US
dc.citation.issue1-3en_US
dc.citation.spage397en_US
dc.citation.epage402en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000166245100030-
dc.citation.woscount1-
Appears in Collections:Articles


Files in This Item:

  1. 000166245100030.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.