Year |
Citation |
Score |
2020 |
Chen G, Chiba S, Gould RJ, Gu X, Saito A, Tsugaki M, Yamashita T. Spanning bipartite graphs with high degree sum in graphs Discrete Mathematics. 343: 111663. DOI: 10.1016/J.Disc.2019.111663 |
0.393 |
|
2020 |
Liu M, Shan H, Gu X. Spectral characterization of the complete graph removing a path Discrete Applied Mathematics. 284: 499-512. DOI: 10.1016/J.Dam.2020.04.011 |
0.486 |
|
2018 |
Chen G, Gould RJ, Gu X, Saito A. Cycles with a chord in dense graphs Discrete Mathematics. 341: 2131-2141. DOI: 10.1016/J.Disc.2018.04.016 |
0.484 |
|
2018 |
Gu X, Lai H. A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs Discrete Mathematics. 341: 400-404. DOI: 10.1016/J.Disc.2017.09.007 |
0.507 |
|
2016 |
Hong Y, Gu X, Lai H, Liu Q. Fractional spanning tree packing, forest covering and eigenvalues Discrete Applied Mathematics. 213: 219-223. DOI: 10.1016/J.Dam.2016.04.027 |
0.545 |
|
2016 |
Gu X, Lai HJ, Li P, Yao S. Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs Journal of Graph Theory. 81: 16-29. DOI: 10.1002/Jgt.21857 |
0.603 |
|
2014 |
Gu X, Lai H. Augmenting and preserving partition connectivity of a hypergraph The Journal of Combinatorics. 5: 271-289. DOI: 10.4310/Joc.2014.V5.N3.A1 |
0.557 |
|
2014 |
Liu Q, Hong Y, Gu X, Lai H. Note on edge-disjoint spanning trees and eigenvalues Linear Algebra and Its Applications. 458: 128-133. DOI: 10.1016/J.Laa.2014.05.044 |
0.578 |
|
2013 |
Gu X, Lai H. Realizing degree sequences with k-edge-connected uniform hypergraphs Discrete Mathematics. 313: 1394-1400. DOI: 10.1016/J.Disc.2013.03.003 |
0.474 |
|
2011 |
Gu X, Lai H, Yao S. Characterization of minimally (2,l)-connected graphs Information Processing Letters. 111: 1124-1129. DOI: 10.1016/J.Ipl.2011.09.012 |
0.568 |
|
2009 |
Subramani K, Lai H, Gu X. Random walks for selected boolean implication and equivalence problems Acta Informatica. 46: 155-168. DOI: 10.1007/S00236-009-0089-4 |
0.488 |
|
Show low-probability matches. |