[r,s,t] - Colouring of One Kind of Join Graphs (CPCI-S收录) | |
Mo Ming-Zhong[1]; Pan Yu-Mei[1] | |
会议名称 | PROCEEDINGS OF THE 2012 INTERNATIONAL CONFERENCE ON COMMUNICATION, ELECTRONICS AND AUTOMATION ENGINEERING |
关键词 | Empty graph Cycle Join graphs [r, s, t]-colouring [r,s,t]-chromatic number |
URL标识 | 查看原文 |
内容类型 | 会议论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/2050583 |
专题 | 华南理工大学 |
作者单位 | Liuzhou Teachers Coll, Dept Math & Comp Sci, Liuzhou 545004, Guangxi, Peoples R China |
推荐引用方式 GB/T 7714 | Mo Ming-Zhong[1],Pan Yu-Mei[1]. [r,s,t] - Colouring of One Kind of Join Graphs (CPCI-S收录)[C]. 见:PROCEEDINGS OF THE 2012 INTERNATIONAL CONFERENCE ON COMMUNICATION, ELECTRONICS AND AUTOMATION ENGINEERING. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论