The 4-Choosability of Plane Graphs without 4-Cycles | |
Peter Che Bor Lam; Baogang Xu; Jiazhuang Liu | |
刊名 | Journal of Combinatorial Theory, Series B |
1999 | |
卷号 | 76期号:1页码:117-126 |
关键词 | list coloring choosability plane graph 4-cycle |
URL标识 | 查看原文 |
内容类型 | 期刊论文 |
URI标识 | http://www.corc.org.cn/handle/1471x/6794716 |
专题 | 山东大学 |
作者单位 | 1.Department of Mathematics, Hong Kong Baptist University, 224 Waterloo Road, Kowloon, Hong Kong 2.Institute of Mathematics, Sha |
推荐引用方式 GB/T 7714 | Peter Che Bor Lam,Baogang Xu,Jiazhuang Liu. The 4-Choosability of Plane Graphs without 4-Cycles[J]. Journal of Combinatorial Theory, Series B,1999,76(1):117-126. |
APA | Peter Che Bor Lam,Baogang Xu,&Jiazhuang Liu.(1999).The 4-Choosability of Plane Graphs without 4-Cycles.Journal of Combinatorial Theory, Series B,76(1),117-126. |
MLA | Peter Che Bor Lam,et al."The 4-Choosability of Plane Graphs without 4-Cycles".Journal of Combinatorial Theory, Series B 76.1(1999):117-126. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论