2 citations · 2 across the 2 of their papers we have counts for
2 papers
math.CO2026
A sharp density bound for 5-connected graphs with no $\Ke$ minor
Caibing Chang, Zijian Deng, Qinfei Tang +1
Let $\Ke$ be obtained from by deleting two independent edges. We prove that every 5-connected graph on vertices with at least edges contains a $\Ke$ minor, set…
math.CO2023★ 2 cited
Integer k-matching preclusion of graphs
Caibing Chang, Yan Liu
As a generalization of matching preclusion number of a graph, we provide the (strong) integer -matching preclusion number, abbreviated as number ( number), whi…