18 citations · 20 across the 6 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2018
Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations
Fengming Dong, Jun Ge, Helin Gong +3
The chromatic polynomial of a graph of order can be expressed as , where is interpreted as the number of broken-cycle…
math.CO2017
Several extreme coefficients of the Tutte polynomial of graphs
Helin Gong, Mengchen Li, Xian'an Jin
Let be the coefficient of in the Tutte polynomial of a connected bridgeless and loopless graph with order and size . It is trivial that $t_…
math.CO2015
A formula for the number of the spanning trees of line graphs
Helin Gong, Xian'an Jin
Let be a loopless graph and be the set of all spanning trees of . Let be the line graph of the graph and be the number of spannin…