| 标题: | 图的均匀着色与点排序 Equitable Coloring and Vertex Ordering of Graphs |
| 作者: | 林武雄 Lin Wu-Hsiung 国立交通大学应用数学系（所） |
| 公开日期: | 2014 |
| 官方说明文件#: | MOST103-2115-M009-005 |
| URI: | http://hdl.handle.net/11536/98752 https://www.grb.gov.tw/search/planDetail?id=8318074&docId=440578 |
| 显示于类别： | Research Plans |
- THE EQUITABLE CHROMATIC THRESHOLD OF THE CARTESIAN PRODUCT OF BIPARTITE GRAPHS IS AT MOST 4 / Yan, Zhidan;Lin, Wu-Hsiung;Wang, Wei
- 乘积图的均匀着色 / 林武雄;Lin Wu-Hsiung
- 幂次图的均匀着色 / 林武雄
- 凯莱图的均匀着色 / 林武雄;Lin Wu-Hsiung
- Maximal sets of hamilton cycles in K(2p)-F / Fu, H. L.;Logan, S. L.;Rodger, C. A.
- On minimum sets of 1-factors covering a complete multipartite graph / Cariolaro, David;Fu, Hung-Lin
- Integral distance graphs / Chen, JJ;Chang, GJ;Huang, KC
- A NOTE ON THE ASCENDING SUBGRAPH DECOMPOSITION PROBLEM / FU, HL
- Three-quarter approximation for the number of unused colors in graph coloring / Tzeng, WG;King, GH
Loading...