The following pages link to Fayun Cao (Q1756083):
Displaying 4 items.
- Bounds for judicious balanced bipartitions of graphs (Q1756085) (← links)
- New formulae for the bipartite vertex frustration and decycling number of graphs (Q2008493) (← links)
- Upper bounds for the independence polynomial of graphs at \(-1\) (Q2049008) (← links)
- Nonseparating independent sets of Cartesian product graphs (Q2300678) (← links)
