1 citations · 1 across the 3 of their papers we have counts for
4 papers
-Positive caterpillars have maximum degree at most three
Davion Q. B. Tang, David G. L. Wang, Monica M. Y. Wang
Dahlberg, She, and van Willigenburg conjectured that every -positive tree has maximum degree at most three. We prove this conjecture for caterpillars. Our proof introduces a spe…
Positive -expansions for KPKP graphs, twinned lollipops, and kayak paddles
Davion Q. B. Tang, David G. L. Wang
We derive explicit positive -expansions for the chromatic symmetric functions of several graph families. First, we obtain a uniform formula for KPKP graphs that specializes to…
Chromatic symmetric functions of conjoined graphs
E. Y. J. Qi, D. Q. B. Tang, D. G. L. Wang
We introduce path-conjoined graphs defined for two rooted graphs by joining their roots with a path, and investigate the chromatic symmetric functions of its two generalizations: s…
The spiders are -positive
Davion Q. B. Tang, David G. L. Wang, Monica M. Y. Wang
Using the composition method, we establish the -positivity of spiders of the form , as conjectured by Aliniaeifard, van Willigenburg and Wang. Following a di…