The following pages link to Xingxing Yu (Q251549):
Displaying 50 items.
- Approximate min-max relations on plane graphs (Q358640) (← links)
- On judicious bisections of graphs (Q402590) (← links)
- Upper bounds on minimum balanced bipartitions (Q409437) (← links)
- Bonds with parity constraints (Q414634) (← links)
- Induced forests in bipartite planar graphs (Q501988) (← links)
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
- Independent paths and \(K_{5}\)-subdivisions (Q602715) (← links)
- On several partitioning problems of Bollobás and Scott (Q602718) (← links)
- On a bipartition problem of Bollobás and Scott (Q624186) (← links)
- Approximating the chromatic index of multigraphs (Q630193) (← links)
- Maximum IPP codes of length 3 (Q659811) (← links)
- A note on balanced bipartitions (Q709305) (← links)
- Partitioning 3-uniform hypergraphs (Q765201) (← links)
- The Kelmans-Seymour conjecture. I: Special separations (Q777488) (← links)
- The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\) (Q777489) (← links)
- The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\) (Q777490) (← links)
- The Kelmans-Seymour conjecture. IV: A proof (Q777491) (← links)
- Contractible cliques in \(k\)-connected graphs (Q855302) (← links)
- The circumference of a graph with no \(K_{3,t}\)-minor (Q859611) (← links)
- On tight components and anti-tight components (Q897283) (← links)
- Non-separating cycles and discrete Jordan curves (Q913818) (← links)
- Bounds for pairs in partitions of graphs (Q982612) (← links)
- Judicious \(k\)-partitions of graphs (Q1003836) (← links)
- On neighbourhood line graphs (Q1182866) (← links)
- On several symmetry conditions for graphs (Q1193428) (← links)
- On a problem of Hendry (Q1193441) (← links)
- On 3-connected graphs with contractible edge covers of size \(k\) (Q1197021) (← links)
- Ends in spanning trees (Q1198517) (← links)
- Cyclomatic numbers of connected induced subgraphs (Q1199496) (← links)
- Small circuit double covers of cubic multigraphs (Q1322014) (← links)
- Independence ratios of graph powers (Q1322230) (← links)
- 4-connected projective planar graphs are Hamiltonian (Q1333330) (← links)
- Convex programming and circumference of 3-connected graphs of low genus (Q1354114) (← links)
- Five-connected toroidal graphs are Hamiltonian (Q1354120) (← links)
- Subdivisions in planar graphs (Q1366603) (← links)
- Tutte cycles in circuit graphs (Q1379828) (← links)
- Disjoint paths in graphs. I: 3-planar graphs and basic obstructions (Q1400805) (← links)
- Disjoint paths in graphs. II: A special case (Q1400806) (← links)
- Disjoint paths in graphs. III: Characterization (Q1407501) (← links)
- Hamiltonian knot projections and lengths of thick knots. (Q1421985) (← links)
- A note on fragile graphs (Q1598838) (← links)
- Circumference of 3-connected cubic graphs (Q1682212) (← links)
- Non-separating paths in 4-connected graphs (Q1773879) (← links)
- Covering planar graphs with forests (Q1775897) (← links)
- Long cycles in 3-connected graphs (Q1850624) (← links)
- Graph connectivity after path removal (Q1878600) (← links)
- Cycles in 4-connected planar graphs (Q1883288) (← links)
- Non-contractible edges in a 3-connected graph (Q1900184) (← links)
- Maximum directed cuts in graphs with degree constraints (Q1926032) (← links)
- The circumference of a graph with no \(K_{3,t}\)-minor. II (Q1931398) (← links)
