首页 | 本学科首页   官方微博 | 高级检索  
     检索      

ON 3-CHOOSABIL ITY OF PL ANE GRAPHSON3 -CHOOSABIL ITY OF PL ANE GRAPHS WITHOUT 6-,7-AND 9-CYCLES
作者姓名:Zhang Haihui  Xu Baogang  School of Math. and Comput. Sci.  Nanjing Normal Univ.  Nanjing  China.   Dept.of Math.  Huaiyin Teachers College  Huaian  China
作者单位:Zhang Haihui1,2 Xu Baogang1  School of Math. and Comput. Sci.,Nanjing Normal Univ.,Nanjing 2 1 0 0 97,China. 2   Dept.of Math.,Huaiyin Teachers College,Huaian2 2 30 0 1,China
基金项目:supported by the National Natural Science Foundation of China(1 0 0 0 1 0 35)
摘    要:§ 1  IntroductionAll graphs considered in this paper are finite,simple plane graphs.G=(V,E,F)denotes a plane graph,with V,E and F being the set of vertices,edges and faces of G,respectively.Two vertices u and v are adjacent,denoted by uv∈E,if there is an edge in Ejoining them.A vertex u is incident with an edge e if u is an endvertex of e.Two faces aresaid to be adjacent if they share a common edge.We use b(f) to denote the boundary of aface f.A face is incident with all vertices and e…


ON 3-CHOOSABIL ITY OF PL ANE GRAPHSON3 -CHOOSABIL ITY OF PL ANE GRAPHS WITHOUT 6-,7-AND 9-CYCLES
Abstract:
Keywords:cycle  girth  choosable  plane graph
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号