| 用面扩树的方法找三次图的边三着色 |
| |
| 引用本文： | 程斌. 用面扩树的方法找三次图的边三着色[J]. 中央民族大学学报(自然科学版), 2005, 14(3): 209-213,240 |
| |
| 作者姓名： | 程斌 |
| |
| 作者单位： | 中央民族大学,数学与计算机科学学院,北京,100081 |
| |
| 摘 要： | 本文通过分析三次图中面的奇偶性及组合情况,引出了可边三色块的概念,接着用面扩树方式给出了三次图中大量的可边三色块,在这些可边三色块中导出了三次图的一些边三色解.
|
| 关 键 词： | 三次图 二色子图 极大平面图 |
| 文章编号： | 1005-8036（2005）03-0209-05 |
| 收稿时间： | 2004-10-20 |
| 修稿时间： | 2004-10-20 |
Three-colored Answers for Cubic Graph by Expand Trees with Face |
| |
| CHENG Bin. Three-colored Answers for Cubic Graph by Expand Trees with Face[J]. Journal of The Central University for Nationalities(Natural Sciences Edition), 2005, 14(3): 209-213,240 |
| |
| Authors: | CHENG Bin |
| |
| Abstract: | We analyzed the characters of odd-even and combination of cubic graph, and got the concept of pieces-can-be-three-colored. Most of pieces-can-be-three-colored were found by the method of expand trees with face. We educed many edge three -colored answers from pieces-can-be-three-colored of cubic graph. |
| |
| Keywords: | cubic graph bichromatic subgraph maximal planar graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
