2003•Shuxue de shijian yu renshiRequires access
Several Results for k-deleted Bipartite Graph
Yang Hong-chen
Open publisher page 0 citations
Abstract
A k-regular spanning subgraph of graph G is called a k-factor of G. Graph G is called a k-deleted graph if G-e has a k-factor for each edge e. It is proved that a bipartite graph G=(X,Y) with ｜X｜=｜Y｜ is a k-deleted graph if and only if k|S|≤r 1+2r 2+…+k(r k+…+r Δ)-e(S) for all SX. Then we give a sufficient degree condition for a bipartite graph to be k-deleted graph.