The Toughness of a Toroidal Graph with Connectivity 3 and Girth 6 is Exactly 1. - Weiting Cao; Michael J. Pelsmajer (Graphs Comb., 2004)

Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs. - Peter Hamburger; Weiting Cao (Electron. Notes Discret. Math., 2005)

Improved Bounds on Families Under k -wise Set-Intersection Constraints. - Weiting Cao; Kyung-Won Hwang; Douglas B. West (Graphs Comb., 2007)

Solution of fink & straight conjecture on path-perfect complete bipartite graphs. - Weiting Cao; Peter Hamburger (J. Graph Theory, 2007)

On the Bar Visibility Number of Complete Bipartite Graphs. - Weiting Cao; Douglas B. West; Yan Yang (SIAM J. Discret. Math., 2021)