| 中国展览馆问题与平图的4着色 |
| |
| 引用本文： | 侴万禧,雷小磊.中国展览馆问题与平图的4着色[J].松辽学刊,2010,31(1):6-8. |
| |
| 作者姓名： | 侴万禧 雷小磊 |
| |
| 作者单位： | 安徽理工大学土木建筑学院,安徽潍南232001 |
| |
| 摘 要： | 提出了中国展览馆问题，目的就在于解决：①任意图的4着色问题；②任意图的生成树的构造与计数问题。阐明了解决对偶图4着色问题和任意C（p，q）的生成树的构造与计数问题的基本思路．提出了基于森林E分解的对偶图的顶点4着色方法和基于2颗被分解的对偶树T^A和T^B进行任意图的生成树构造的方法．介绍了森林Fi的3种分解方法．
|
| 关 键 词： | 展览馆 平图 4着色 对偶图 顶点 生成树 |
The Chinese Exibition Hall Problem and 4-colouring of Plan Graph |
| |
| CHOU Wan-xi,LEI Xiao-lei.The Chinese Exibition Hall Problem and 4-colouring of Plan Graph[J].Songliao Journal (Natural Science Edition),2010,31(1):6-8. |
| |
| Authors: | CHOU Wan-xi LEI Xiao-lei |
| |
| Institution: | CHOU Wan-xi,LEI Xiao-lei(School of Civil Engineering , Architecture,Anhui University of Science , Technology,Huainan 232001,China) |
| |
| Abstract: | The Chinese Exibition Hall Problem is proposed for the purpose of solving the problem concerning 4-colouring of arbitrary graph and the problem concerning the construction and enumeration of spanning frees.The basic concept of solving the problem concerning 4-colouring of dual and the problem concerning the constraction and enumeration of spanning trees is described.The method of 4-colouring the rertices of dual on the basic of decomposition into a forest and the method of constracting and enumerating the s... |
| |
| Keywords: | exibition hall plan graph 4-colouring dual vertices spanning frees |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
