1 citations · 1 across the 3 of their papers we have counts for
4 papers
The Montesinos-Nakanishi 3-move conjecture for links up to 20 crossings
Rhea Palak Bakshi, Benjamin A. Burton, Huizheng Guo +4
Yasutaka Nakanishi formulated the following conjecture in 1981: every link is 3-move equivalent to a trivial link. While the conjecture was proved for several specific cases, it re…
On the notion of Khovanov A-adequacy
Lizzie Buchanan, Huizheng Guo, Gabriel Montoya-Vega +2
The concept of adequate links, introduced by Lickorish and Thistlethwaite as a generalization of alternating links, has recently gained interest among knot theorists in the context…
The Generalized Kauffman-Harary Conjecture is True
Rhea Palak Bakshi, Huizheng Guo, Gabriel Montoya-Vega +2
For a reduced alternating diagram of a knot with a prime determinant the Kauffman-Harary conjecture states that every non-trivial Fox -coloring of the knot assigns differen…
Pairs of disjoint matchings and related classes of graphs
Huizheng, Guo, Kieran Kaempen +6
For a finite graph , we study the maximum -edge colorable subgraph problem and a related ratio , where is the matching number of , and is…