Bing Wei

collaborators

2 papers

math.CO2025

Bipartite holes, degree sums and Hamilton cycles

Mark Ellingham, Yixuan Huang, Bing Wei

The {\em bipartite-hole-number} of a graph $G$ , denoted as $I^\pm (G)$ , is the minimum number $k$ such that there exist integers $a$ and $b$ with $a + b = k + 1$ such that for…

math.CO2025

Independent Bondage Number in Graphs under Girth Constraints

E. G. K. M. Gamlath, Andrew Pham, Bing Wei

Given a finite, simple graph $G$ , the independent bondage number of $G$ is the minimum size of an edge set such that its deletion results in a graph with strictly larger independen…