|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1 occurrences of 1 keywords
|
|
|
|
|
Results
Found 61 publication records. Showing 61 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Jie Ma, Xingxing Yu |
Partitioning 3-uniform hypergraphs.  |
J. Comb. Theory, Ser. B  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Xujin Chen, Guoli Ding, Xingxing Yu, Wenan Zang |
Bonds with parity constraints. |
J. Comb. Theory, Ser. B |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Genghua Fan, Baogang Xu, Xingxing Yu, Chuixiang Zhou |
Upper bounds on minimum balanced bipartitions. |
Discrete Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Bilinski, Bill Jackson, Jie Ma, Xingxing Yu |
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs. |
J. Comb. Theory, Ser. B |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, Xingxing Yu, Wenan Zang |
Approximating the chromatic index of multigraphs. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Baogang Xu, Xingxing Yu |
Better Bounds for k-Partitions of Graphs. |
Combinatorics, Probability & Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jie Ma, Xingxing Yu |
Independent paths and K5-subdivisions. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jie Ma, Pei-Lan Yen, Xingxing Yu |
On several partitioning problems of Bollobás and Scott. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Baogang Xu, Juan Yan, Xingxing Yu |
A note on balanced bipartitions. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jie Ma, Xingxing Yu |
Bounds for pairs in partitions of graphs. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Baogang Xu, Juan Yan, Xingxing Yu |
Balanced judicious bipartitions of graphs. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Baogang Xu, Xingxing Yu |
Judicious k-partitions of graphs. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Qing Cui, Jian Wang, Xingxing Yu |
Hamilton circles in infinite planar graphs. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, Xingxing Yu, Wenan Zang |
Preface. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Baogang Xu, Xingxing Yu |
On a bipartition problem of Bollobás and Scott. |
Combinatorica |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Baogang Xu, Xingxing Yu |
Triangle-free subcubic graphs with minimum bipartite density. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Xingxing Yu |
Hamilton Cycles in Planar Locally Finite Graphs. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Xingxing Yu |
Infinite paths in planar graphs V, 3-indivisible graphs. |
Journal of Graph Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Bilinski, Young Soo Kwon, Xingxing Yu |
On the reconstruction of planar graphs. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Zemin Jin, Xingxing Yu, Xiaoyan Zhang |
Contractible subgraphs in k-connected graphs. |
Journal of Graph Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Wen Jiang, Geoffrey Ye Li, Xingxing Yu |
Truncation for Low-Complexity MIMO Signal Detection. |
IEEE Transactions on Information Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Xingxing Yu, Florian Zickfeld |
Reducing Hajós' 4-coloring conjecture to 4-connected graphs. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, Laura Sheppardson, Xingxing Yu, Wenan Zang |
The circumference of a graph with no K3, t-minor. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaolong Huang, Zemin Jin, Xingxing Yu, Xiaoyan Zhang |
Contractible Cliques in k-Connected Graphs. |
Graphs and Combinatorics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Xingxing Yu |
Infinite paths in planar graphs IV, dividing cycles. |
Journal of Graph Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Xingxing Yu |
Infinite paths in planar graphs III, 1-way infinite paths. |
Journal of Graph Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang |
Approximating Longest Cycles in Graphs with Bounded Degrees. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Sean Curran, Orlando Lee, Xingxing Yu |
Finding Four Independent Trees . |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | József Balogh, Martin Kochol, András Pluhár, Xingxing Yu |
Covering planar graphs with forests. |
J. Comb. Theory, Ser. B |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin Thomas, Xingxing Yu, Wenan Zang |
Hamilton paths in toroidal graphs. |
J. Comb. Theory, Ser. B |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Sean Curran, Orlando Lee, Xingxing Yu |
Nonseparating Planar Chains in 4-Connected Graphs. |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Sean Curran, Orlando Lee, Xingxing Yu |
Chain Decompositions of 4-Connected Graphs. |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Xingxing Yu |
Infinite paths in planar graphs II, structures and ladder nets. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang |
Approximating the Longest Cycle Problem on Graphs with Bounded Degree. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, Genghua Fan, Xingxing Yu |
Cycles in 4-connected planar graphs. |
Eur. J. Comb. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Liang Sun, Xingxing Yu |
Positively curved cubic plane graphs are finite. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Xingxing Yu |
Infinite paths in planar graphs I: Graphs with radial nets. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, Jun Xu, Xingxing Yu |
Circumference of Graphs with Bounded Degree. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun Xu, Abhishek Kumar, Xingxing Yu |
On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. |
IEEE Journal on Selected Areas in Communications |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhishek Kumar, Shashidhar Merugu, Jun Xu, Ellen W. Zegura, Xingxing Yu |
Ulysses: a robust, low-diameter, low-latency peer-to-peer network. |
European Transactions on Telecommunications |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, Ronald J. Gould, Xingxing Yu |
Graph Connectivity After Path Removal. |
Combinatorica |
2003 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 05C40, 05C38 |
| 1 | Sean Curran, Xingxing Yu |
Nonseparating Cycles in 4-Connected Graphs. |
SIAM J. Discrete Math. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Sean Curran, Orlando Lee, Xingxing Yu |
Chain decompositions and independent trees in 4-connected graphs. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhishek Kumar, Shashidhar Merugu, Jun Xu, Xingxing Yu |
Ulysses: A Robust, Low-Diameter, Low-Latency Peer-ti-Peer Network. |
ICNP |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, Xingxing Yu |
Long Cycles in 3-Connected Graphs. |
J. Comb. Theory, Ser. B |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, Xingxing Yu |
A note on fragile graphs. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Xingxing Yu |
Subdivisions in Planar Graphs. |
J. Comb. Theory, Ser. B |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhicheng Gao, Xingxing Yu |
Tutte cycles in circuit graphs. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin Thomas, Xingxing Yu |
Five-Connected Toroidal Graphs Are Hamiltonian. |
J. Comb. Theory, Ser. B |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhicheng Gao, Xingxing Yu |
Convex Programming and Circumference of 3-Connected Graphs of Low Genus. |
J. Comb. Theory, Ser. B |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshimi Egawa, Katsuhiro Ota, Akira Saito, Xingxing Yu |
Non-Contractible Edges in A 3-Connected Graph. |
Combinatorica |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin Thomas, Xingxing Yu |
4-Connected Projective-Planar Graphs Are Hamiltonian. |
J. Comb. Theory, Ser. B |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Hong-Jian Lai, Xingxing Yu, Cun-Quan Zhang |
Small Circuit Double Covers of Cubic Multigraphs. |
J. Comb. Theory, Ser. B |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Hell, Xingxing Yu, Huishan Zhou |
Independence ratios of graph powers. |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Xingxing Yu |
Non-separating cycles and discrete Jordan curves. |
J. Comb. Theory, Ser. B |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Xingxing Yu |
Cyclomatic numbers of connected induced subgraphs. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | M. R. Hart, Xingxing Yu |
On a problem of Hendry. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Xingxing Yu |
Ends in spanning trees. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Xingxing Yu |
On several symmetry conditions for graphs. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert L. Hemminger, Xingxing Yu |
On 3-connected graphs with contractible edge covers of size k. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Xingxing Yu |
On neighbourhood line graphs. |
Discrete Mathematics |
1990 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #61 of 61 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")