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


[2,3]-factors in a 3-connected infinite planar graph
Authors:Hwan-Ok Jung
Institution:1. Departent of Mathematics, Hanshin University, 447-791, Osan, Korea
Abstract:For two integersm, n withm<-n, anm, n]-factorF in a graphG is a spanning subgraph ofG withm<-d F (v)<-n for allv∈V(F). In 1996, H. Enomoto et al. proved that every 3-connected planar graphG withd G (v)>-4 for allv∈V(G) contains a 2,3]-factor. In this paper we extend their result to all 3-connected locally finite infinite planar graphs containing no unbounded faces.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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