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


A closure concept in factor-critical graphs
Institution:Department of Mathematics, Shibaura Institute of Technology, Fukasaku, Saitama 330-8570, Japan
Abstract:A graph G is called n-factor-critical if the removal of every set of n vertices results in a~graph with a~1-factor. We prove the following theorem: Let G be a~graph and let x be a~locally n-connected vertex. Let {u,v} be a~pair of vertices in V(G)−{x} such that uvE(G), xNG(u)∩NG(v), and NG(x)⊂NG(u)∪NG(v)∪{u,v}. Then G is n-factor-critical if and only if G+uv is n-factor-critical.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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