default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXingxing Yu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j119]Yuzhenni Wang, Xingxing Yu, Xiao-Dong Zhang
:
A class of trees determined by their chromatic symmetric functions. Discret. Math. 347(9): 114096 (2024)- [j118]Xiying Du, Yanjia Li, Shijie Xie, Xingxing Yu:
Linkages and removable paths avoiding vertices. J. Comb. Theory B 169: 211-232 (2024) - 2023
- [j117]Hongliang Lu, Yan Wang, Xingxing Yu:
A better bound on the size of rainbow matchings. J. Comb. Theory A 195: 105700 (2023) - [j116]Michael C. Wigal, Youngho Yoo, Xingxing Yu:
Approximating TSP walks in subcubic graphs. J. Comb. Theory B 158(Part): 70-104 (2023) - [j115]Michael C. Wigal, Xingxing Yu:
Tutte paths and long cycles in circuit graphs. J. Comb. Theory B 158(Part): 313-330 (2023) - [j114]Xiaonan Liu, Joshua Schroeder, Zhiyu Wang, Xingxing Yu:
Polynomial χ-binding functions for t-broom-free graphs. J. Comb. Theory B 162: 118-133 (2023) - [j113]Hongliang Lu, Yan Wang, Xingxing Yu:
Co-degree threshold for rainbow perfect matchings in uniform hypergraphs. J. Comb. Theory B 163: 83-111 (2023) - [j112]Xingxing Yu, Ying Zhu, Yan Cao, Juan Xiong:
Time-Domain Numerical Simulation and Experimental Study on Pulsed Eddy Current Inspection of Tubing and Casing. Sensors 23(3): 1135 (2023) - 2022
- [j111]Hongliang Lu, Xingxing Yu:
A Note on Exact Minimum Degree Threshold for Fractional Perfect Matchings. Graphs Comb. 38(3): 80 (2022) - [j110]Junran Lichen, Jianping Li, Ko-Wei Lih, Xingxing Yu:
Approximation algorithms for constructing required subgraphs using stock pieces of fixed length. J. Comb. Optim. 44(3): 1774-1795 (2022) - [j109]Jianping Li, Junran Lichen, Wencheng Wang, Jean Yeh, Yeong-Nan Yeh, Xingxing Yu, Yujie Zheng:
1-line minimum rectilinear steiner trees and related problems. J. Comb. Optim. 44(4): 2832-2852 (2022) - [j108]Xiaonan Liu, Zhiyu Wang, Xingxing Yu:
Counting Hamiltonian cycles in planar triangulations. J. Comb. Theory B 155: 256-277 (2022) - [j107]Qiqin Xie, Shijie Xie, Xingxing Yu, Xiaofan Yuan:
4-Separations in Hajós graphs. J. Graph Theory 99(3): 485-508 (2022) - [j106]Hongliang Lu, Yan Wang, Xingxing Yu:
Rainbow Perfect Matchings for 4-Uniform Hypergraphs. SIAM J. Discret. Math. 36(3): 1645-1662 (2022) - 2021
- [j105]Hongliang Lu, Xingxing Yu, Xiaofan Yuan:
Rainbow matchings for 3-uniform hypergraphs. J. Comb. Theory A 183: 105489 (2021) - [j104]Qiqin Xie, Shijie Xie, Xingxing Yu, Xiaofan Yuan:
Wheels in planar graphs and Hajós graphs. J. Graph Theory 98(2): 179-194 (2021) - [j103]Guanwu Liu, Xingxing Yu:
Partitioning digraphs with outdegree at least 4. J. Graph Theory 98(4): 604-622 (2021) - [j102]Xiaonan Liu, Xingxing Yu:
Number of Hamiltonian Cycles in Planar Triangulations. SIAM J. Discret. Math. 35(2): 1005-1021 (2021) - [j101]Hongliang Lu, Xingxing Yu, Xiaofan Yuan:
Nearly Perfect Matchings in Uniform Hypergraphs. SIAM J. Discret. Math. 35(2): 1022-1049 (2021) - [j100]Zhao Chen, Xingxing Yu:
A Novel Tensor Network for Tropical Cyclone Intensity Estimation. IEEE Trans. Geosci. Remote. Sens. 59(4): 3226-3243 (2021) - [i2]Michael C. Wigal, Youngho Yoo, Xingxing Yu:
Approximating TSP walks in subcubic graphs. CoRR abs/2112.06278 (2021) - 2020
- [j99]Jie Ma, Tianyun Tang, Xingxing Yu:
Monochromatic Subgraphs in Iterated Triangulations. Electron. J. Comb. 27(4): 4 (2020) - [j98]Rose McCarty, Yan Wang, Xingxing Yu:
7-Connected graphs are 4-ordered. J. Comb. Theory B 141: 115-135 (2020) - [j97]Dawei He, Yan Wang, Xingxing Yu:
The Kelmans-Seymour conjecture I: Special separations. J. Comb. Theory B 144: 197-224 (2020) - [j96]Dawei He, Yan Wang, Xingxing Yu:
The Kelmans-Seymour conjecture II: 2-Vertices in K4-. J. Comb. Theory B 144: 225-264 (2020) - [j95]Dawei He, Yan Wang, Xingxing Yu:
The Kelmans-Seymour conjecture III: 3-vertices in K4-. J. Comb. Theory B 144: 265-308 (2020) - [j94]Dawei He, Yan Wang, Xingxing Yu:
The Kelmans-Seymour conjecture IV: A proof. J. Comb. Theory B 144: 309-358 (2020) - [c15]Junran Lichen, Jianping Li, Wencheng Wang, Jean Yeh, Yeong-Nan Yeh, Xingxing Yu, Yujie Zheng:
On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane ℝ2. AAIM 2020: 49-61 - [c14]Xingxing Yu, Zhao Chen, He Zhang, Yuxin Zheng:
A Novel Deep Learning Framework for Tropical Cyclone Intensity Estimation Using FY-4 Satellite Imagery. ICIAI 2020: 10-14 - [c13]Zhao Chen, Xingxing Yu, Feng Zhou, Bin Yang:
A Regularized Tensor Network for Cyclone Wind Speed Estimation. IGARSS 2020: 1090-1093
2010 – 2019
- 2019
- [j93]Mingxia Liu, Xiaoming You, Xingxing Yu, Sheng Liu:
KL Divergence-Based Pheromone Fusion for Heterogeneous Multi-Colony Ant Optimization. IEEE Access 7: 152646-152657 (2019) - [j92]Yuliang Ji, Jie Ma, Juan Yan, Xingxing Yu:
On problems about judicious bipartitions of graphs. J. Comb. Theory B 139: 230-250 (2019) - [j91]Hongliang Lu, Yan Wang, Xingxing Yu:
Minimum codegree condition for perfect matchings in k-partite k-graphs. J. Graph Theory 92(3): 207-229 (2019) - [c12]Junran Lichen, Jianping Li, Ko-Wei Lih, Xingxing Yu:
On Approximations for Constructing Required Subgraphs Using Stock Pieces of Fixed Length. AAIM 2019: 192-202 - [c11]Xingxing Yu, Zhao Chen, Guangchen Chen, He Zhang, Junfeng Zhou:
A Tensor Network for Tropical Cyclone Wind Speed Estimation. IGARSS 2019: 10007-10010 - [c10]Guangchen Chen, Zhao Chen, Feng Zhou, Xingxing Yu, He Zhang, Lingyun Zhu:
A Semisupervised Deep Learning Framework for Tropical Cyclone Intensity Estimation. MultiTemp 2019: 1-4 - 2018
- [j90]Genghua Fan, Jianfeng Hou, Xingxing Yu:
Bisections of Graphs Without Short Cycles. Comb. Probab. Comput. 27(1): 44-59 (2018) - [j89]Qinghai Liu, Xingxing Yu, Zhao Zhang:
Circumference of 3-connected cubic graphs. J. Comb. Theory B 128: 134-159 (2018) - [j88]Hongliang Lu, Xingxing Yu, Li Zhang:
Disjoint perfect matchings in 3-uniform hypergraphs. J. Graph Theory 88(2): 284-293 (2018) - [j87]Hongliang Lu, Xingxing Yu:
On Rainbow Matchings for Hypergraphs. SIAM J. Discret. Math. 32(1): 382-393 (2018) - [j86]Hongliang Lu, Yan Wang, Xingxing Yu:
Almost Perfect Matchings in k-Partite k-Graphs. SIAM J. Discret. Math. 32(1): 522-533 (2018) - [j85]Le Liang, Shijie Xie, Geoffrey Ye Li, Zhi Ding, Xingxing Yu:
Graph-Based Resource Sharing in Vehicular Communication. IEEE Trans. Wirel. Commun. 17(7): 4579-4592 (2018) - [j84]Lu Lu, Dawei He, Qiqin Xie, Geoffrey Ye Li, Xingxing Yu:
Graph-Based Path Selection and Power Allocation for DF Relay-Aided Transmission. IEEE Wirel. Commun. Lett. 7(1): 138-141 (2018) - [c9]Le Liang, Shijie Xie, Geoffrey Ye Li, Zhi Ding, Xingxing Yu:
Graph-Based Radio Resource Management for Vehicular Networks. ICC 2018: 1-6 - [i1]Le Liang, Shijie Xie, Geoffrey Ye Li, Zhi Ding, Xingxing Yu:
Graph-Based Radio Resource Management for Vehicular Networks. CoRR abs/1801.02679 (2018) - 2016
- [j83]Jie Ma, Xingxing Yu:
On judicious bipartitions of graphs. Comb. 36(5): 537-556 (2016) - [j82]Yuqin Sun, Xingxing Yu:
On a Coloring Conjecture of Hajós. Graphs Comb. 32(1): 351-361 (2016) - [j81]Jie Ma, Qiqin Xie, Xingxing Yu:
Graphs Containing Topological H. J. Graph Theory 82(2): 121-153 (2016) - [c8]Binglei Wang, Xingxing Yu, Ran Wei, Chenxing Yuan, Xiaoyu Li, Chun-Hou Zheng:
System Prediction of Drug-Drug Interactions Through the Integration of Drug Phenotypic, Therapeutic, Structural, and Genomic Similarities. ICIC (1) 2016: 377-385 - [c7]Lu Lu, Dawei He, Qiqin Xie, Geoffrey Ye Li, Xingxing Yu:
Graph-based path selection and power allocation for relay-aided transmission. WCNC 2016: 1-6 - 2015
- [j80]Changhong Lu, Kan Wang, Xingxing Yu:
On Tight Components and Anti-Tight Components. Graphs Comb. 31(6): 2293-2297 (2015) - [j79]Ken-ichi Kawarabayashi, Jie Ma, Xingxing Yu:
Subdivisions of K5 in graphs containing K2, 3. J. Comb. Theory B 113: 18-67 (2015) - [j78]Yanmei Hong, Liying Kang, Xingxing Yu:
Nonseparating Cycles Avoiding Specific Vertices. J. Graph Theory 80(4): 253-267 (2015) - [j77]Lu Lu, Dawei He, Geoffrey Ye Li, Xingxing Yu:
Graph-Based Robust Resource Allocation for Cognitive Radio Networks. IEEE Trans. Signal Process. 63(14): 3825-3836 (2015) - 2014
- [j76]Baogang Xu, Xingxing Yu:
On judicious bisections of graphs. J. Comb. Theory B 106: 30-69 (2014) - [j75]Genghua Fan, Baogang Xu, Tianjun Ye, Xingxing Yu:
Forbidden Subgraphs and 3-Colorings. SIAM J. Discret. Math. 28(3): 1226-1256 (2014) - [c6]Lu Lu, Dawei He, Xingxing Yu, Geoffrey Ye Li:
Graph-based robust resource allocation for cognitive radio networks. ICASSP 2014: 7298-7302 - 2013
- [j74]Jie Ma, Xingxing Yu, Wenan Zang:
Approximate min-max relations on plane graphs. J. Comb. Optim. 26(1): 127-134 (2013) - [j73]Jie Ma, Xingxing Yu:
K5-Subdivisions in graphs containing K-4. J. Comb. Theory B 103(6): 713-732 (2013) - [c5]Lu Lu, Dawei He, Xingxing Yu, Geoffrey Ye Li:
Energy-efficient resource allocation for cognitive radio networks. GLOBECOM 2013: 1026-1031 - 2012
- [j72]Genghua Fan, Baogang Xu, Xingxing Yu, Chuixiang Zhou:
Upper bounds on minimum balanced bipartitions. Discret. Math. 312(6): 1077-1083 (2012) - [j71]Baogang Xu, Xingxing Yu:
Maximum Directed Cuts in Graphs with Degree Constraints. Graphs Comb. 28(4): 563-574 (2012) - [j70]Jie Ma, Xingxing Yu:
Partitioning 3-uniform hypergraphs. J. Comb. Theory B 102(1): 212-232 (2012) - [j69]Xujin Chen, Guoli Ding, Xingxing Yu, Wenan Zang:
Bonds with parity constraints. J. Comb. Theory B 102(3): 588-609 (2012) - [j68]Guantao Chen, Xingxing Yu, Wenan Zang:
The circumference of a graph with no K3, t-minor, II. J. Comb. Theory B 102(6): 1211-1240 (2012) - 2011
- [j67]Baogang Xu, Xingxing Yu:
Better Bounds for k-Partitions of Graphs. Comb. Probab. Comput. 20(4): 631-640 (2011) - [j66]Guantao Chen, Xingxing Yu, Wenan Zang:
Approximating the chromatic index of multigraphs. J. Comb. Optim. 21(2): 219-246 (2011) - [j65]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 B 101(4): 214-236 (2011) - 2010
- [j64]Jie Ma, Xingxing Yu:
Bounds for pairs in partitions of graphs. Discret. Math. 310(15-16): 2069-2081 (2010) - [j63]Baogang Xu, Juan Yan, Xingxing Yu:
A note on balanced bipartitions. Discret. Math. 310(20): 2613-2617 (2010) - [j62]Jie Ma, Xingxing Yu:
Independent paths and K5-subdivisions. J. Comb. Theory B 100(6): 600-616 (2010) - [j61]Jie Ma, Pei-Lan Yen, Xingxing Yu:
On several partitioning problems of Bollobás and Scott. J. Comb. Theory B 100(6): 631-649 (2010) - [j60]Baogang Xu, Juan Yan, Xingxing Yu:
Balanced judicious bipartitions of graphs. J. Graph Theory 63(3): 210-225 (2010)
2000 – 2009
- 2009
- [j59]Baogang Xu, Xingxing Yu:
On a bipartition problem of Bollobás and Scott. Comb. 29(5): 595-618 (2009) - [j58]Guantao Chen, Xingxing Yu, Wenan Zang:
Preface. Discret. Math. 309(5): 1019 (2009) - [j57]Qing Cui, Jian Wang, Xingxing Yu:
Hamilton circles in infinite planar graphs. J. Comb. Theory B 99(1): 110-138 (2009) - [j56]Baogang Xu, Xingxing Yu:
Judicious k-partitions of graphs. J. Comb. Theory B 99(2): 324-337 (2009) - 2008
- [j55]Baogang Xu, Xingxing Yu:
Triangle-free subcubic graphs with minimum bipartite density. J. Comb. Theory B 98(3): 516-537 (2008) - [j54]Xingxing Yu:
Infinite paths in planar graphs V, 3-indivisible graphs. J. Graph Theory 57(4): 275-312 (2008) - [j53]Henning Bruhn, Xingxing Yu:
Hamilton Cycles in Planar Locally Finite Graphs. SIAM J. Discret. Math. 22(4): 1381-1392 (2008) - 2007
- [j52]Mark Bilinski, Young Soo Kwon, Xingxing Yu:
On the reconstruction of planar graphs. J. Comb. Theory B 97(5): 745-756 (2007) - [j51]Zemin Jin, Xingxing Yu, Xiaoyan Zhang:
Contractible subgraphs in k-connected graphs. J. Graph Theory 55(2): 121-136 (2007) - [j50]Wen Jiang, Geoffrey Ye Li, Xingxing Yu:
Truncation for Low-Complexity MIMO Signal Detection. IEEE Trans. Inf. Theory 53(4): 1564-1571 (2007) - 2006
- [j49]Zhicheng Gao, R. Bruce Richter, Xingxing Yu:
Erratum to 2-walks in 3-connected planar graphs. Australas. J Comb. 36: 315- (2006) - [j48]Xiaolong Huang, Zemin Jin, Xingxing Yu, Xiaoyan Zhang:
Contractible Cliques in k-Connected Graphs. Graphs Comb. 22(3): 361-370 (2006) - [j47]Xingxing Yu, Florian Zickfeld:
Reducing Hajós' 4-coloring conjecture to 4-connected graphs. J. Comb. Theory B 96(4): 482-492 (2006) - [j46]Guantao Chen, Laura Sheppardson, Xingxing Yu, Wenan Zang:
The circumference of a graph with no K3, t-minor. J. Comb. Theory B 96(6): 822-845 (2006) - [j45]Xingxing Yu:
Infinite paths in planar graphs III, 1-way infinite paths. J. Graph Theory 51(3): 175-198 (2006) - [j44]Xingxing Yu:
Infinite paths in planar graphs IV, dividing cycles. J. Graph Theory 53(3): 173-195 (2006) - [j43]Sean Curran, Orlando Lee, Xingxing Yu:
Finding Four Independent Trees . SIAM J. Comput. 35(5): 1023-1058 (2006) - [j42]Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang:
Approximating Longest Cycles in Graphs with Bounded Degrees. SIAM J. Comput. 36(3): 635-656 (2006) - 2005
- [j41]József Balogh, Martin Kochol, András Pluhár, Xingxing Yu:
Covering planar graphs with forests. J. Comb. Theory B 94(1): 147-158 (2005) - [j40]Robin Thomas, Xingxing Yu, Wenan Zang:
Hamilton paths in toroidal graphs. J. Comb. Theory B 94(2): 214-236 (2005) - [j39]Xingxing Yu:
Infinite paths in planar graphs II, structures and ladder nets. J. Graph Theory 48(4): 247-266 (2005) - [j38]Sean Curran, Orlando Lee, Xingxing Yu:
Nonseparating Planar Chains in 4-Connected Graphs. SIAM J. Discret. Math. 19(2): 399-419 (2005) - [j37]Sean Curran, Orlando Lee, Xingxing Yu:
Chain Decompositions of 4-Connected Graphs. SIAM J. Discret. Math. 19(4): 848-880 (2005) - [c4]Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang:
Approximating the Longest Cycle Problem on Graphs with Bounded Degree. COCOON 2005: 870-884 - 2004
- [j36]Guantao Chen, Genghua Fan, Xingxing Yu:
Cycles in 4-connected planar graphs. Eur. J. Comb. 25(6): 763-780 (2004) - [j35]Abhishek Kumar, Shashidhar Merugu, Jun (Jim) Xu, Ellen W. Zegura, Xingxing Yu:
Ulysses: a robust, low-diameter, low-latency peer-to-peer network. Eur. Trans. Telecommun. 15(6): 571-587 (2004) - [j34]Xingxing Yu:
Infinite paths in planar graphs I: Graphs with radial nets. J. Graph Theory 47(2): 147-162 (2004) - [j33]Liang Sun, Xingxing Yu:
Positively curved cubic plane graphs are finite. J. Graph Theory 47(4): 241-274 (2004) - [j32]Jun (Jim) Xu, Abhishek Kumar, Xingxing Yu:
On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. IEEE J. Sel. Areas Commun. 22(1): 151-163 (2004) - [j31]Guantao Chen, Jun Xu, Xingxing Yu:
Circumference of Graphs with Bounded Degree. SIAM J. Comput. 33(5): 1136-1170 (2004) - [c3]Wen Jiang, Xingxing Yu, Geoffrey Ye Li:
Bi-truncation for simplified MIMO signal detection. GLOBECOM 2004: 401-405 - 2003
- [j30]Guantao Chen, Ronald J. Gould, Xingxing Yu:
Graph Connectivity After Path Removal. Comb. 23(2): 185-203 (2003) - [j29]Sean Curran, Xingxing Yu:
Nonseparating Cycles in 4-Connected Graphs. SIAM J. Discret. Math. 16(4): 616-629 (2003) - [c2]Abhishek Kumar, Shashidhar Merugu, Jun (Jim) Xu, Xingxing Yu:
Ulysses: A Robust, Low-Diameter, Low-Latency Peer-ti-Peer Network. ICNP 2003: 258-267 - [c1]Sean Curran, Orlando Lee, Xingxing Yu:
Chain decompositions and independent trees in 4-connected graphs. SODA 2003: 186-191 - 2002
- [j28]Guantao Chen, Xingxing Yu:
A note on fragile graphs. Discret. Math. 249(1-3): 41-43 (2002) - [j27]Guantao Chen, Xingxing Yu:
Long Cycles in 3-Connected Graphs. J. Comb. Theory B 86(1): 80-99 (2002) - [j26]Laura Sheppardson, Xingxing Yu:
Long cycles in 3-connected graphs in orientable surfaces. J. Graph Theory 41(2): 69-84 (2002) - [j25]Bill Jackson, Xingxing Yu:
Hamilton cycles in plane triangulations. J. Graph Theory 41(2): 138-150 (2002)
1990 – 1999
- 1998
- [j24]Zhicheng Gao, Xingxing Yu:
Tutte cycles in circuit graphs. Discret. Math. 182(1-3): 113-124 (1998) - [j23]Xingxing Yu:
Subdivisions in Planar Graphs. J. Comb. Theory B 72(1): 10-52 (1998) - 1997
- [j22]Zhicheng Gao, Xingxing Yu:
Convex Programming and Circumference of 3-Connected Graphs of Low Genus. J. Comb. Theory B 69(1): 39-51 (1997) - [j21]Robin Thomas, Xingxing Yu:
Five-Connected Toroidal Graphs Are Hamiltonian. J. Comb. Theory B 69(1): 79-96 (1997) - 1996
- [j20]Nathaniel Dean, Robin Thomas, Xingxing Yu:
Spanning paths in infinite planar graphs. J. Graph Theory 23(2): 163-174 (1996) - 1995
- [j19]Zhicheng Gao, R. Bruce Richter, Xingxing Yu:
2-walks in 3-connected planar graphs. Australas. J Comb. 11: 117-122 (1995) - [j18]Yoshimi Egawa, Katsuhiro Ota, Akira Saito, Xingxing Yu:
Non-Contractible Edges in A 3-Connected Graph. Comb. 15(3): 357-364 (1995) - 1994
- [j17]Pavol Hell, Xingxing Yu, Huishan Zhou:
Independence ratios of graph powers. Discret. Math. 127(1-3): 213-220 (1994) - [j16]Hong-Jian Lai, Xingxing Yu, Cun-Quan Zhang:
Small Circuit Double Covers of Cubic Multigraphs. J. Comb. Theory B 60(2): 177-194 (1994) - [j15]Robin Thomas, Xingxing Yu:
4-Connected Projective-Planar Graphs Are Hamiltonian. J. Comb. Theory B 62(1): 114-132 (1994) - [j14]Xingxing Yu:
3-connected graphs with non-cut contractible edge covers of size k. J. Graph Theory 18(4): 401-411 (1994) - [j13]Ronald J. Gould, Xingxing Yu:
On hamiltonian-connected graphs. J. Graph Theory 18(8): 841-860 (1994) - 1993
- [j12]Robert L. Hemminger, Xingxing Yu:
Covering contractible edges in 3-connected graphs. II. Characterizing those with covers of size three. J. Graph Theory 17(2): 247-252 (1993) - 1992
- [j11]Robert E. L. Aldred, Robert L. Hemminger, Xingxing Yu:
Maximum matchings in 3-connected graphs contain contractible edges. Australas. J Comb. 6: 23-34 (1992) - [j10]Robert L. Hemminger, Xingxing Yu:
On 3-connected graphs with contractible edge covers of size k. Discret. Math. 101(1-3): 115-133 (1992) - [j9]Xingxing Yu:
On several symmetry conditions for graphs. Discret. Math. 102(1): 51-59 (1992) - [j8]M. R. Hart, Xingxing Yu:
On a problem of Hendry. Discret. Math. 102(1): 107-108 (1992) - [j7]Xingxing Yu:
Ends in spanning trees. Discret. Math. 104(3): 327-328 (1992) - [j6]Xingxing Yu:
Cyclomatic numbers of connected induced subgraphs. Discret. Math. 105(1-3): 275-284 (1992) - [j5]Xingxing Yu:
Non-separating cycles and discrete Jordan curves. J. Comb. Theory B 54(1): 142-154 (1992) - 1991
- [j4]Xingxing Yu:
On the cycle-isomorphism of graphs. J. Graph Theory 15(1): 19-27 (1991) - 1990
- [j3]Xingxing Yu:
On neighbourhood line graphs. Discret. Math. 91(3): 295-309 (1990) - [j2]Xingxing Yu:
Trees and unicyclic graphs with hamiltonian path graphs. J. Graph Theory 14(6): 705-708 (1990)
1980 – 1989
- 1988
- [j1]Mark N. Ellingham, László Pyber, Xingxing Yu:
Claw-free graphs are edge reconstructible. J. Graph Theory 12(3): 445-451 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-14 00:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
