Partitioning H-minor-free graphs into three subgraphs with no large components
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Liu, Chun Hung | - |
| dc.contributor.author | Oum, Sang Il | - |
| dc.date.accessioned | 2016-07-13T03:54:49Z | - |
| dc.date.available | 2016-07-13T03:54:49Z | - |
| dc.date.created | 2015-12-25 | - |
| dc.date.issued | 2015-03-13 | - |
| dc.identifier.citation | 7th KIAS Combinatorics Workshop | - |
| dc.identifier.uri | http://hdl.handle.net/10203/211123 | - |
| dc.language | Korean | - |
| dc.publisher | KIAS | - |
| dc.title | Partitioning H-minor-free graphs into three subgraphs with no large components | - |
| dc.type | Conference | - |
| dc.type.rims | CONF | - |
| dc.citation.publicationname | 7th KIAS Combinatorics Workshop | - |
| dc.identifier.conferencecountry | KO | - |
| dc.identifier.conferencelocation | KIAS | - |
| dc.contributor.localauthor | Oum, Sang Il | - |
| dc.contributor.nonIdAuthor | Liu, Chun Hung | - |
- Appears in Collection
- MA-Conference Papers(학술회의논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.