Bin Jia

collaborators

2 papers

math.CO2015

Excluding long paths

Bin Jia

Ding (1992) proved that for each integer $m ⩾ 0$ , and every infinite sequence of finite simple graphs $G_{1}, G_{2}, \dots$ , if none of these graphs contains a path of lengt…

math.CO2009

A class of symmetric graphs with 2-arc-transitive quotients

Bin Jia, Zaiping Lu, Gaixia Wang

Let $Γ$ be a finite X-symmetric graph with a nontrivial X-invariant partition $B$ on $V (Γ)$ such that $Γ_{B}$ is a connected (X,2)-arc-transitive graph and $Γ…