Some new sufficient conditions for $2p$-Hamilton-biconnectedness of graphs

@article{Chen2017SomeNS,
  title={Some new sufficient conditions for \$2p\$-Hamilton-biconnectedness of graphs},
  author={Ming-Zhu Chen and Xiaodong Zhang},
  journal={arXiv: Combinatorics},
  year={2017}
}
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)\backslash W$ is Hamilton-biconnected. In this paper, we prove that "Let $p\geq0$ and $G$ be a balanced bipartite graph of order $2n$ with minimum degree $\delta(G)\geq k$, where $n\geq 2k-p+2$ and $k\geq p$. If the number of edges $ e(G)>n(n-k+p-1)+(k+2)(k-p+1), $ then $G$ is $2p$-Hamilton-biconnected except some exceptions." Furthermore… Expand

Figures from this paper

References

SHOWING 1-10 OF 16 REFERENCES
A Degree Sum Condition for Hamiltonicity in Balanced Bipartite Digraphs
  • J. Adamus
  • Mathematics, Computer Science
  • Graphs Comb.
  • 2017
A method in graph theory
Biclosure and bistability in a balanced bipartite graph
Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
On the First Eigenvalue of Bipartite Graphs
...
1
2
...