咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >Uniquely Tree Colorable Graphs 收藏

Uniquely Tree Colorable Graphs

Uniquely Tree Colorable Graphs

作     者:Deng Ping Department of Applied Mathematics, Southwest Jiaotong University, Chengdu 610031, China 

出 版 物:《Journal of Modern Transportation》 (现代交通学报(英文版))

年 卷 期:1997年第14卷第1期

页      面:90-95页

学科分类:07[理学] 070104[理学-应用数学] 0701[理学-数学] 

主  题:tree chromatic number tree partition uniquely tree colorable graph 

摘      要:In this paper, the concepts of tree chromatic numbers and uniquely tree colorable graphs are introduced. After discussion some fundamental properties, three necessary conditions for a simple graph to be uniquely tree colorable are given. Moreover, a series of uniquely tree colorable graphs are constructed.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分