期刊论文详细信息
| Electronic Journal Of Combinatorics | |
| Fair Splitting of Colored Paths | |
| Meysam Alishahi1 | |
| 关键词: Independent sets; Necklace splitting; Octahedral Tucker lemma; | |
| DOI : | |
| 学科分类：离散数学和组合数学 | |
| 来源: Electronic Journal Of Combinatorics | |
 PDF
|
|
【 摘 要 】
This paper deals with two problems about splitting fairly a path with colored vertices, where "fairly" means that each part contains almost the same amount of vertices in each color.
【 授权许可】
Others
【 预 览 】
| Files | Size | Format | View |
|---|---|---|---|
| RO201909029870926ZK.pdf | 240KB |  download |
878987797
028-85220240
