The following pages link to Xiaofeng Gu (Q313821):
Displayed 45 items.
- Fractional spanning tree packing, forest covering and eigenvalues (Q313822) (← links)
- Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs (Q389497) (← links)
- Regular factors and eigenvalues of regular graphs (Q404439) (← links)
- Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees (Q452949) (← links)
- Augmenting and preserving partition connectivity of a hypergraph (Q482272) (← links)
- Characterizations of strength extremal graphs (Q489310) (← links)
- Spectral characterization of the complete graph removing a path (Q777427) (← links)
- Spectral conditions for edge connectivity and packing spanning trees in multigraphs (Q905705) (← links)
- Random walks for selected Boolean implication and equivalence problems (Q1014275) (← links)
- Cycles with a chord in dense graphs (Q1637124) (← links)
- A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs (Q1685990) (← links)
- Improved algorithms for optimal length resolution refutation in difference constraint systems (Q1941901) (← links)
- Characterization of minimally \((2,l)\)-connected graphs (Q1944218) (← links)
- Spectral conditions for graph rigidity in the Euclidean plane (Q2043397) (← links)
- Spectral strengthening of a theorem on transversal critical graphs (Q2065896) (← links)
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues (Q2066004) (← links)
- Extremal augmented Zagreb index of trees with given numbers of vertices and leaves (Q2075506) (← links)
- Spanning tree packing and 2-essential edge-connectivity (Q2092353) (← links)
- Toughness in pseudo-random graphs (Q2225447) (← links)
- Note on edge-disjoint spanning trees and eigenvalues (Q2250921) (← links)
- Spanning bipartite graphs with high degree sum in graphs (Q2279986) (← links)
- Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs (Q2359795) (← links)
- Spectral characterization of the complete graph removing a path: completing the proof of Cámara-Haemers conjecture (Q2659187) (← links)
- Graph toughness from Laplacian eigenvalues (Q2700326) (← links)
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs (Q2828824) (← links)
- (Q3009744) (← links)
- Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs (Q3466350) (← links)
- (Q3643948) (← links)
- Spanning Rigid Subgraph Packing and Sparse Subgraph Covering (Q4568066) (← links)
- A Proof of Brouwer's Toughness Conjecture (Q4990394) (← links)
- (Q5159209) (← links)
- Sufficient Conditions for 2-Dimensional Global Rigidity (Q5163515) (← links)
- Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs (Q5321692) (← links)
- Absorbing random walks and the NAE2SAT problem (Q5391499) (← links)
- (Q5412355) (← links)
- On hamiltonian line graphs of hypergraphs (Q6081552) (← links)
- ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs (Q6081885) (← links)
- Spectral radius and edge‐disjoint spanning trees (Q6084711) (← links)
- Spectral characterization of the complete graph removing a cycle (Q6126164) (← links)
- Graph rigidity properties of Ramanujan graphs (Q6133153) (← links)
- Cyclically orderable generalized Petersen graphs (Q6167021) (← links)
- Characterizations of minimal graphs with equal edge connectivity and spanning tree packing number (Q6255679) (← links)
- Graph toughness from Laplacian eigenvalues (Q6364836) (← links)
- A unified combinatorial view beyond some spectral properties (Q6400588) (← links)
- l-connectivity, l-edge-connectivity and spectral radius of graphs (Q6450625) (← links)