default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXiaofeng Gu 0002
Person information
- affiliation: University of West Georgia, Department of Computing and Mathematics, Carrollton, GA, USA
- affiliation (PhD 2013): West Virginia University, Department of Mathematics, Morgantown, WV, USA
Other persons with the same name
- Xiaofeng Gu — disambiguation page
- Xiaofeng Gu 0001
![[0000-0001-8299-6451]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-8299-6451")
(aka: Xiao-Feng Gu 0001, Xiao-feng Gu 0001) — Jiangnan University, Department of Electronic Engineering, Wuxi, China (and 2 more) - Xiaofeng Gu 0003 — Tsinghua University, Beijing National Research Center for Information Science and Technology (BNRist), Department of Automation, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j31]Xiaofeng Gu, Jessica Li, Eric H. Yang, William Y. Zhang:
Cyclic base ordering of certain degenerate graphs. Discret. Appl. Math. 362: 148-156 (2025)- 2024
- [j30]Xiaofeng Gu, William Zhang:
Cyclic base ordering of generalized Petersen graphs. Discret. Math. Algorithms Appl. 16(2): 2350019:1-2350019:19 (2024) - [j29]Muhuo Liu, Xiaofeng Gu, Haiying Shan, Zoran Stanic:
Spectral characterization of the complete graph removing a cycle. J. Comb. Theory, Ser. A 205: 105868 (2024) - 2023
- [j28]Sebastian M. Cioaba, Sean Dewar, Georg Grasegger, Xiaofeng Gu:
Graph Rigidity Properties of Ramanujan Graphs. Electron. J. Comb. 30(3) (2023) - [j27]Xiaofeng Gu, Runrun Liu, Gexin Yu:
Spanning tree packing and 2-essential edge-connectivity. Discret. Math. 346(1): 113132 (2023) - [j26]Dandan Fan, Xiaofeng Gu, Huiqiu Lin:
Spectral radius and edge-disjoint spanning trees. J. Graph Theory 104(4): 697-711 (2023) - 2022
- [j25]Muhuo Liu, Xiaofeng Gu:
Spectral strengthening of a theorem on transversal critical graphs. Discret. Math. 345(3): 112717 (2022) - [j24]Chaohui Chen, Muhuo Liu, Xiaofeng Gu, Kinkar Chandra Das:
Extremal augmented Zagreb index of trees with given numbers of vertices and leaves. Discret. Math. 345(4): 112753 (2022) - [j23]Xiaofeng Gu, Muhuo Liu:
A tight lower bound on the matching number of graphs via Laplacian eigenvalues. Eur. J. Comb. 101: 103468 (2022) - [j22]Xiaofeng Gu, Hong-Jian Lai, Sulin Song:
On hamiltonian line graphs of hypergraphs. J. Graph Theory 100(3): 489-503 (2022) - [j21]Ran Gu, Xiaofeng Gu, Yongtang Shi, Hua Wang:
ℓ $\ell $ -Connectivity and ℓ $\ell $ -edge-connectivity of random graphs. J. Graph Theory 101(1): 5-28 (2022) - [c2]Xiaofeng Gu, William Zhang:
Cyclically Orderable Generalized Petersen Graphs. AAIM 2022: 303-315 - 2021
- [j20]Muhuo Liu, Xiaofeng Gu:
Spectral characterization of the complete graph removing a path: Completing the proof of Cámara-Haemers Conjecture. Discret. Math. 344(4): 112275 (2021) - [j19]Sebastian M. Cioaba, Sean Dewar, Xiaofeng Gu:
Spectral conditions for graph rigidity in the Euclidean plane. Discret. Math. 344(10): 112527 (2021) - [j18]Xiaofeng Gu:
Toughness in pseudo-random graphs. Eur. J. Comb. 92: 103255 (2021) - [j17]Xiaofeng Gu:
A Proof of Brouwer's Toughness Conjecture. SIAM J. Discret. Math. 35(2): 948-952 (2021) - [j16]Xiaofeng Gu, Wei Meng, Martin Rolek, Yue Wang, Gexin Yu:
Sufficient Conditions for 2-Dimensional Global Rigidity. SIAM J. Discret. Math. 35(4): 2520-2534 (2021) - 2020
- [j15]Muhuo Liu, Haiying Shan, Xiaofeng Gu:
Spectral characterization of the complete graph removing a path. Discret. Appl. Math. 284: 499-512 (2020) - [j14]Guantao Chen, Shuya Chiba, Ronald J. Gould, Xiaofeng Gu, Akira Saito, Masao Tsugaki, Tomoki Yamashita:
Spanning bipartite graphs with high degree sum in graphs. Discret. Math. 343(2): 111663 (2020)
2010 – 2019
- 2018
- [j13]Xiaofeng Gu, Hong-Jian Lai:
A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs. Discret. Math. 341(2): 400-404 (2018) - [j12]Guantao Chen, Ronald J. Gould, Xiaofeng Gu, Akira Saito:
Cycles with a chord in dense graphs. Discret. Math. 341(8): 2131-2141 (2018) - [j11]Yinkui Li, Yongtang Shi, Xiaofeng Gu:
Spectrum bounds for the scattering number, integrity, tenacity of regular graphs. Future Gener. Comput. Syst. 83: 450-453 (2018) - 2017
- [j10]Xiaofeng Gu:
Packing spanning trees and spanning 2-connected k-edge-connected essentially (2k-1)-edge-connected subgraphs. J. Comb. Optim. 33(3): 924-933 (2017) - 2016
- [j9]Yanmei Hong, Xiaofeng Gu, Hong-Jian Lai, Qinghai Liu:
Fractional spanning tree packing, forest covering and eigenvalues. Discret. Appl. Math. 213: 219-223 (2016) - [j8]Xiaofeng Gu, Hong-Jian Lai, Ping Li, Senmei Yao:
Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs. J. Graph Theory 81(1): 16-29 (2016) - [i1]Sebastian M. Cioaba, Xiaofeng Gu:
Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs. CoRR abs/1602.05922 (2016) - 2014
- [j7]Xiaofeng Gu, Hong-Jian Lai, Ping Li, Senmei Yao:
Characterizations of Strength Extremal Graphs. Graphs Comb. 30(6): 1453-1461 (2014) - 2013
- [j6]Xiaofeng Gu, Hong-Jian Lai:
Realizing degree sequences with k-edge-connected uniform hypergraphs. Discret. Math. 313(11): 1394-1400 (2013) - [j5]K. Subramani, Matthew D. Williamson, Xiaofeng Gu:
Improved algorithms for optimal length resolution refutation in difference constraint systems. Formal Aspects Comput. 25(2): 319-341 (2013) - 2012
- [j4]Xiaofeng Gu, Hong-Jian Lai, Yanting Liang:
Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees. Appl. Math. Lett. 25(10): 1426-1429 (2012) - 2011
- [j3]K. Subramani, Xiaofeng Gu:
Absorbing random walks and the NAE2SAT problem. Int. J. Comput. Math. 88(3): 452-467 (2011) - [j2]Xiaofeng Gu, Hong-Jian Lai, Senmei Yao:
Characterization of minimally (2, l)-connected graphs. Inf. Process. Lett. 111(23-24): 1124-1129 (2011)
2000 – 2009
- 2009
- [j1]K. Subramani, Hong-Jian Lai, Xiaofeng Gu:
Random walks for selected boolean implication and equivalence problems. Acta Informatica 46(2): 155-168 (2009) - [c1]Xiaofeng Gu, Kamesh Madduri, K. Subramani, Hong-Jian Lai:
Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs. FAW 2009: 40-50
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-09 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
