|
Search the dblp DataBase
Xingxing Yu:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang
Approximating the Longest Cycle Problem on Graphs with Bounded Degree. [Citation Graph (0, 0)][DBLP] COCOON, 2005, pp:870-884 [Conf]
- Abhishek Kumar, Shashidhar Merugu, Jun Xu, Xingxing Yu
Ulysses: A Robust, Low-Diameter, Low-Latency Peer-ti-Peer Network. [Citation Graph (0, 0)][DBLP] ICNP, 2003, pp:258-267 [Conf]
- Sean Curran, Orlando Lee, Xingxing Yu
Chain decompositions and independent trees in 4-connected graphs. [Citation Graph (0, 0)][DBLP] SODA, 2003, pp:186-191 [Conf]
- Guantao Chen, Ronald J. Gould, Xingxing Yu
Graph Connectivity After Path Removal. [Citation Graph (0, 0)][DBLP] Combinatorica, 2003, v:23, n:2, pp:185-203 [Journal]
- Yoshimi Egawa, Katsuhiro Ota, Akira Saito, Xingxing Yu
Non-Contractible Edges in A 3-Connected Graph. [Citation Graph (0, 0)][DBLP] Combinatorica, 1995, v:15, n:3, pp:357-364 [Journal]
- Guantao Chen, Xingxing Yu
A note on fragile graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:249, n:1-3, pp:41-43 [Journal]
- Guantao Chen, Genghua Fan, Xingxing Yu
Cycles in 4-connected planar graphs. [Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2004, v:25, n:6, pp:763-780 [Journal]
- Xiaolong Huang, Zemin Jin, Xingxing Yu, Xiaoyan Zhang
Contractible Cliques in k-Connected Graphs. [Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2006, v:22, n:3, pp:361-370 [Journal]
- József Balogh, Martin Kochol, András Pluhár, Xingxing Yu
Covering planar graphs with forests. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2005, v:94, n:1, pp:147-158 [Journal]
- Guantao Chen, Xingxing Yu
Long Cycles in 3-Connected Graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2002, v:86, n:1, pp:80-99 [Journal]
- Zhicheng Gao, Xingxing Yu
Convex Programming and Circumference of 3-Connected Graphs of Low Genus. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1997, v:69, n:1, pp:39-51 [Journal]
- Hong-Jian Lai, Xingxing Yu, Cun-Quan Zhang
Small Circuit Double Covers of Cubic Multigraphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1994, v:60, n:2, pp:177-194 [Journal]
- Robin Thomas, Xingxing Yu
4-Connected Projective-Planar Graphs Are Hamiltonian. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1994, v:62, n:1, pp:114-132 [Journal]
- Robin Thomas, Xingxing Yu
Five-Connected Toroidal Graphs Are Hamiltonian. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1997, v:69, n:1, pp:79-96 [Journal]
- Robin Thomas, Xingxing Yu, Wenan Zang
Hamilton paths in toroidal graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2005, v:94, n:2, pp:214-236 [Journal]
- Xingxing Yu
Non-separating cycles and discrete Jordan curves. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1992, v:54, n:1, pp:142-154 [Journal]
- Xingxing Yu
Subdivisions in Planar Graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1998, v:72, n:1, pp:10-52 [Journal]
- Xingxing Yu, Florian Zickfeld
Reducing Hajós' 4-coloring conjecture to 4-connected graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:482-492 [Journal]
- Guantao Chen, Laura Sheppardson, Xingxing Yu, Wenan Zang
The circumference of a graph with no K3, t-minor. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2006, v:96, n:6, pp:822-845 [Journal]
- Guantao Chen, Jun Xu, Xingxing Yu
Circumference of Graphs with Bounded Degree. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2004, v:33, n:5, pp:1136-1170 [Journal]
- Sean Curran, Orlando Lee, Xingxing Yu
Finding Four Independent Trees . [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:35, n:5, pp:1023-1058 [Journal]
- Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang
Approximating Longest Cycles in Graphs with Bounded Degrees. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:36, n:3, pp:635-656 [Journal]
- Sean Curran, Orlando Lee, Xingxing Yu
Nonseparating Planar Chains in 4-Connected Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2005, v:19, n:2, pp:399-419 [Journal]
- Sean Curran, Orlando Lee, Xingxing Yu
Chain Decompositions of 4-Connected Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2005, v:19, n:4, pp:848-880 [Journal]
- Sean Curran, Xingxing Yu
Nonseparating Cycles in 4-Connected Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2003, v:16, n:4, pp:616-629 [Journal]
- Wen Jiang, Ye Li, Xingxing Yu
Truncation for Low-Complexity MIMO Signal Detection. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2007, v:53, n:4, pp:1564-1571 [Journal]
- Xingxing Yu
Infinite paths in planar graphs II, structures and ladder nets. [Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2005, v:48, n:4, pp:247-266 [Journal]
- Xingxing Yu
Infinite paths in planar graphs III, 1-way infinite paths. [Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2006, v:51, n:3, pp:175-198 [Journal]
- Xingxing Yu
Infinite paths in planar graphs IV, dividing cycles. [Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2006, v:53, n:3, pp:173-195 [Journal]
- Liang Sun, Xingxing Yu
Positively curved cubic plane graphs are finite. [Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2004, v:47, n:4, pp:241-274 [Journal]
- Xingxing Yu
Infinite paths in planar graphs I: Graphs with radial nets. [Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2004, v:47, n:2, pp:147-162 [Journal]
- Zhicheng Gao, Xingxing Yu
Tutte cycles in circuit graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:182, n:1-3, pp:113-124 [Journal]
- Xingxing Yu
On neighbourhood line graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1990, v:91, n:3, pp:295-309 [Journal]
- Robert L. Hemminger, Xingxing Yu
On 3-connected graphs with contractible edge covers of size k. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:101, n:1-3, pp:115-133 [Journal]
- Xingxing Yu
On several symmetry conditions for graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:102, n:1, pp:51-59 [Journal]
- M. R. Hart, Xingxing Yu
On a problem of Hendry. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:102, n:1, pp:107-108 [Journal]
- Xingxing Yu
Ends in spanning trees. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:104, n:3, pp:327-328 [Journal]
- Xingxing Yu
Cyclomatic numbers of connected induced subgraphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:105, n:1-3, pp:275-284 [Journal]
- Pavol Hell, Xingxing Yu, Huishan Zhou
Independence ratios of graph powers. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:127, n:1-3, pp:213-220 [Journal]
- Mark Bilinski, Young Soo Kwon, Xingxing Yu
On the reconstruction of planar graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2007, v:97, n:5, pp:745-756 [Journal]
Preface. [Citation Graph (, )][DBLP]
Bounds for pairs in partitions of graphs. [Citation Graph (, )][DBLP]
A note on balanced bipartitions. [Citation Graph (, )][DBLP]
Search in 0.023secs, Finished in 0.025secs
|