1 A ug 2 01 7 Some new sufficient conditions for 2 p - Hamilton - biconnectedness of graphs ∗

Abstract

A balanced bipartite graph G is said to be 2p-Hamilton-biconnected if for any balanced subset W of size 2p of V (G), the subgraph induced by V (G)\W is Hamilton-biconnected. In this paper, we prove that “ Let p ≥ 0 and G be a balanced bipartite graph of order 2n with minimum degree δ(G) ≥ k, where n ≥ 2k − p + 2 and k ≥ p. If the number of edges e(G) > n(n… (More)

Topics

2 Figures and Tables

Slides referencing similar topics