2 citations · 3 across the 4 of their papers we have counts for
4 papers
Excluding long paths
Bin Jia
Ding (1992) proved that for each integer , and every infinite sequence of finite simple graphs , if none of these graphs contains a path of lengt…
Hadwiger's conjecture for -link graphs
Bin Jia, David R. Wood
In this paper we define and study a new family of graphs that generalises the notions of line graphs and path graphs. Let be a graph with no loops but possibly with parallel ed…
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 on such that is a connected (X,2)-arc-transitive graph and $Γ…
A construction of imprimitive symmetric graphs which are not multicovers of their quotients
Bin Jia
This paper gives a sufficient and necessary condition for the existence of an (X, s)-arc-transitive imprimitive graph which is not a multicover of a given quotient graph.