The following pages link to Xingxing Yu (Q251549):
Displaying 50 items.
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\) (Q2039643) (← links)
- Rainbow matchings for 3-uniform hypergraphs (Q2040498) (← links)
- Approximation algorithms for constructing required subgraphs using stock pieces of fixed length (Q2082192) (← links)
- \(1\)-line minimum rectilinear Steiner trees and related problems (Q2084647) (← links)
- On the rainbow matching conjecture for 3-uniform hypergraphs (Q2090427) (← links)
- Tutte paths and long cycles in circuit graphs (Q2099420) (← links)
- Approximating TSP walks in subcubic graphs (Q2101165) (← links)
- A note on exact minimum degree threshold for fractional perfect matchings (Q2124789) (← links)
- Counting Hamiltonian cycles in planar triangulations (Q2131865) (← links)
- Monochromatic subgraphs in iterated triangulations (Q2209888) (← links)
- 7-connected graphs are 4-ordered (Q2284739) (← links)
- A bound on judicious bipartitions of directed graphs (Q2303909) (← links)
- On problems about judicious bipartitions of graphs (Q2338639) (← links)
- Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\) (Q2347843) (← links)
- Triangle-free subcubic graphs with minimum bipartite density (Q2483477) (← links)
- Hamilton paths in toroidal graphs (Q2485945) (← links)
- Reducing Hajós' 4-coloring conjecture to 4-connected graphs (Q2496200) (← links)
- Hamilton circles in infinite planar graphs (Q2519018) (← links)
- On the reconstruction of planar graphs (Q2642012) (← links)
- A better bound on the size of rainbow matchings (Q2680820) (← links)
- Graphs Containing Topological<i>H</i> (Q2811199) (← links)
- Forbidden Subgraphs and 3-Colorings (Q2935268) (← links)
- (Q3033794) (← links)
- Disjoint paths, planarizing cycles, and spanning walks (Q3127254) (← links)
- Positively curved cubic plane graphs are finite (Q3159382) (← links)
- Infinite paths in planar graphs I: Graphs with radial nets (Q3159397) (← links)
- (Q3412151) (← links)
- Infinite paths in planar graphs IV, dividing cycles (Q3419710) (← links)
- Contractible subgraphs ink-connected graphs (Q3445507) (← links)
- Approximating Longest Cycles in Graphs with Bounded Degrees (Q3446811) (← links)
- Nonseparating Cycles Avoiding Specific Vertices (Q3466341) (← links)
- Truncation for Low-Complexity MIMO Signal Detection (Q3548244) (← links)
- Hamilton Cycles in Planar Locally Finite Graphs (Q3648504) (← links)
- Claw‐free graphs are edge reconstructible (Q3797217) (← links)
- Trees and unicyclic graphs with hamiltonian path graphs (Q3970899) (← links)
- (Q4028262) (← links)
- (Q4033684) (← links)
- The 3‐connected graphs with a maximum matching containing precisely one contractible edge (Q4277986) (← links)
- 3‐connected graphs with non‐cut contractible edge covers of size <i>k</i> (Q4297825) (← links)
- On hamiltonian‐connected graphs (Q4317225) (← links)
- Nonseparating Cycles in 4-Connected Graphs (Q4443114) (← links)
- (Q4471293) (← links)
- Disjoint perfect matchings in 3‐uniform hypergraphs (Q4575532) (← links)
- Graph-Based Robust Resource Allocation for Cognitive Radio Networks (Q4580698) (← links)
- (Q4597161) (← links)
- Bisections of Graphs Without Short Cycles (Q4601051) (← links)
- On Rainbow Matchings for Hypergraphs (Q4602861) (← links)
- Almost Perfect Matchings in $k$-Partite $k$-Graphs (Q4605443) (← links)
- Circumference of Graphs with Bounded Degree (Q4651509) (← links)
