| dc.contributor | 應數系 | en_US |
| dc.creator (作者) | 張宜武 | zh_TW |
| dc.creator (作者) | Chang,Yi-Wu | en_US |
| dc.creator (作者) | Douglas B. West | en_US |
| dc.creator (作者) | Clyde L. Monma | en_US |
| dc.creator (作者) | Michael S. Jacobson | en_US |
| dc.date (日期) | 1993.07 | en_US |
| dc.date.accessioned | 7-Aug-2014 10:06:29 (UTC+8) | - |
| dc.date.available | 7-Aug-2014 10:06:29 (UTC+8) | - |
| dc.date.issued (上傳時間) | 7-Aug-2014 10:06:29 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/68412 | - |
| dc.description.abstract (摘要) | We introduce the star number [tree number] of a graph, being the minimum t such that G is the intersection graph of unions of t substars [subtrees] of a host tree. We study bounds on these parameters, compare them with interval number, and characterize the graphs with star number 1. | en_US |
| dc.format.extent | 1205355 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | Discrete Applied Mathematics,44(1-3),205-220 | en_US |
| dc.subject (關鍵詞) | Intersection graphs; interval number. | en_US |
| dc.title (題名) | Subtree and substar intersection numbers | en_US |
| dc.type (資料類型) | article | en |
