<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css"> Skip to main content

A note on ascending subgraph decompositions of complete multipartite graphs

dc.citation.epage402en_US
dc.citation.issue1-3en_US
dc.citation.spage397en_US
dc.citation.volume226en_US
dc.citation.woscount1
dc.contributor.authorFu, HLen_US
dc.contributor.authorHu, WHen_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.date.accessioned2014-12-08T15:44:17Z
dc.date.available2014-12-08T15:44:17Z
dc.date.issued2001-01-06en_US
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.identifier.issn0012-365Xen_US
dc.identifier.journalDISCRETE MATHEMATICSen_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/29904
dc.identifier.wosnumberWOS:000166245100030
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

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
000166245100030.pdf
Size:
126.94 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: