Jianguo Qian

collaborators

2 papers

math.CO2022

The list-coloring function of signed graphs

Sumin Huang, Jianguo Qian, Wei Wang

It is known that, for any $k$ -list assignment $L$ of a graph $G$ , the number of $L$ -list colorings of $G$ is at least the number of the proper $k$ -colorings of $G$ when $k>(m-1)/\l…

math.CO2021

The maximum number of stars in a graph without linear forest

Sumin Huang, Jianguo Qian

For two graphs $J$ and $H$ , the generalized Turán number, denoted by $e x (n, J, H)$ , is the maximum number of copies of $J$ in an $H$ -free graph of order $n$ . A linear forest $F$ is t…