default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShenggui Zhang
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
[j114]Jiuqiang Liu, Shenggui Zhang, Guihai Yu:
Generating functions and counting formulas for spanning trees and forests in hypergraphs. Adv. Appl. Math. 155: 102667 (2024)- [j113]Yanni Dong, Hajo Broersma
, Yuhang Bai, Shenggui Zhang:
The complexity of spanning tree problems involving graphical indices. Discret. Appl. Math. 347: 143-154 (2024) - [j112]Xiaodi Song, Shenggui Zhang, Xinzhuang Chen, Shanshan Gao:
The algebraic connectivity of barbell graphs. Discret. Math. 347(7): 114027 (2024) - [j111]Yanni Dong, Maximilien Gadouleau, Pengfei Wan, Shenggui Zhang:
Graphs with minimum degree-entropy. Inf. Sci. 671: 120629 (2024) - [j110]Fangfang Wu, Hajo Broersma, Shenggui Zhang, Binlong Li:
Properly colored and rainbow C 4 ${C}_{4}$ 's in edge-colored graphs. J. Graph Theory 105(1): 110-135 (2024) - 2023
- [j109]Yanni Dong, Hajo Broersma, Changwu Song, Pengfei Wan, Shenggui Zhang:
The effect of graph operations on the degree-based entropy. Appl. Math. Comput. 437: 127533 (2023) - [j108]Shanshan Gao, Shenggui Zhang, Xinzhuang Chen, Xiaodi Song:
Effects of adding arcs on the consensus convergence rate of leader-follower multi-agent systems. Appl. Math. Comput. 453: 128086 (2023) - [j107]Tingting Han, Hajo Broersma, Yandong Bai, Shenggui Zhang:
Sufficient conditions for properly colored C3's and C4's in edge-colored complete graphs. Discret. Appl. Math. 327: 101-109 (2023) - [j106]Fangfang Wu, Shenggui Zhang, Binlong Li, Jimeng Xiao:
Anti-Ramsey numbers for vertex-disjoint triangles. Discret. Math. 346(1): 113123 (2023) - [j105]Jia Wei, Shenggui Zhang:
Proof of a conjecture on the spectral radius condition for [a, b]-factors. Discret. Math. 346(3): 113269 (2023) - [j104]Li Zhang, You Lu, Shenggui Zhang:
Signed planar graphs with Δ ≥ 8 are Δ-edge-colorable. Discret. Math. 346(8): 113409 (2023) - [j103]Tingting Han, Shenggui Zhang, Yandong Bai:
Properly colored cycles of different lengths in edge-colored complete graphs. Discret. Math. 346(12): 113653 (2023) - [j102]Hengzhe Li, Ankang Wei, Shenggui Zhang:
2-(Ddge-)Connected Edge Domination Number and Matching Number. Graphs Comb. 39(2): 31 (2023) - [j101]Yuhang Bai, Zhiwei Guo, Shenggui Zhang, Yandong Bai:
Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs. J. Comb. Optim. 45(2): 73 (2023) - 2022
- [j100]Fangfang Wu, Shenggui Zhang, Binlong Li, Tingting Han:
Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs. Discret. Appl. Math. 307: 145-152 (2022) - [j99]Wei Li, Shenggui Zhang, Ruonan Li:
Rainbow triangles in arc-colored digraphs. Discret. Appl. Math. 314: 169-180 (2022) - [j98]Naqi Fan, Lijun Zhang, Shenggui Zhang, Jiuqiang Liu:
Matching Algorithms of Minimum Input Selection for Structural Controllability Based on Semi-Tensor Product of Matrices. J. Syst. Sci. Complex. 35(5): 1808-1823 (2022) - [j97]Xinzhuang Chen, Shenggui Zhang, Lijun Zhang, Guihai Yu, Jiuqiang Liu:
Determining Redundant Links of Multiagent Systems in Keeping or Improving Consensus Convergence Rates. IEEE Syst. J. 16(4): 6153-6163 (2022) - [j96]Xinzhuang Chen, Shanshan Gao, Shenggui Zhang, Yu Zhao:
On Topology Optimization for Event-Triggered Consensus With Triggered Events Reducing and Convergence Rate Improving. IEEE Trans. Circuits Syst. II Express Briefs 69(3): 1223-1227 (2022) - 2021
- [j95]Xiao Wang, You Lu, Shenggui Zhang:
Flow number of signed Halin graphs. Appl. Math. Comput. 393: 125751 (2021) - [j94]Yanni Dong, Shengning Qiao, Bing Chen, Pengfei Wan, Shenggui Zhang:
Maximum values of degree-based entropies of bipartite graphs. Appl. Math. Comput. 401: 126094 (2021) - [j93]Dan Hu, Hajo Broersma, Jiangyou Hou, Shenggui Zhang:
On the Spectra of General Random Mixed Graphs. Electron. J. Comb. 28(1): 1 (2021) - [j92]Yipeng Li, Xiaogang Liu, Shenggui Zhang, Sanming Zhou:
Perfect state transfer in NEPS of complete graphs. Discret. Appl. Math. 289: 98-114 (2021) - [j91]Zhiwei Guo, Hajo Broersma, Binlong Li, Shenggui Zhang:
Almost eulerian compatible spanning circuits in edge-colored graphs. Discret. Math. 344(1): 112174 (2021) - [j90]Li Zhang, You Lu, Shenggui Zhang:
Edge DP-coloring in planar graphs. Discret. Math. 344(5): 112314 (2021) - [j89]Tingting Han, Shenggui Zhang, Yandong Bai, Ruonan Li:
Edge-Colored Complete Graphs Containing No Properly Colored Odd Cycles. Graphs Comb. 37(3): 1129-1138 (2021) - [j88]Wei Li, Shenggui Zhang, Yandong Bai, Ruonan Li:
Rainbow Triangles in Arc-Colored Tournaments. Graphs Comb. 37(4): 1271-1290 (2021) - [i3]Yanni Dong, Maximilien Gadouleau, Pengfei Wan, Shenggui Zhang:
Graphs with minimum degree-based entropy. CoRR abs/2108.13884 (2021) - 2020
- [j87]Yipeng Li, Xiaogang Liu, Shenggui Zhang:
Laplacian state transfer in Q-graph. Appl. Math. Comput. 384: 125370 (2020) - [j86]Yandong Bai, Binlong Li, Shenggui Zhang:
Kernels by rainbow paths in arc-colored tournaments. Discret. Appl. Math. 282: 14-21 (2020) - [j85]Li Zhang, You Lu, Rong Luo, Dong Ye, Shenggui Zhang:
Edge coloring of signed graphs. Discret. Appl. Math. 282: 234-242 (2020) - [j84]Ruonan Li, Binlong Li, Shenggui Zhang:
A classification of edge-colored graphs based on properly colored walks. Discret. Appl. Math. 283: 590-595 (2020) - [j83]Chuandong Xu, Hongna Yang, Shenggui Zhang:
On characterizing the critical graphs for matching Ramsey numbers. Discret. Appl. Math. 287: 15-20 (2020) - [j82]Wei Zheng, Hajo Broersma, Ligong Wang, Shenggui Zhang:
Conditions on subgraphs, degrees, and domination for hamiltonian properties of graphs. Discret. Math. 343(1): 111644 (2020) - [j81]Zhiwei Guo, Binlong Li, Xueliang Li, Shenggui Zhang:
Compatible spanning circuits in edge-colored graphs. Discret. Math. 343(7): 111908 (2020) - [j80]Chuandong Xu, Colton Magnant, Shenggui Zhang:
Properly colored C4's in edge-colored graphs. Discret. Math. 343(12): 112116 (2020) - [j79]Donghan Zhang, You Lu, Shenggui Zhang:
Neighbor Sum Distinguishing Total Choosability of Cubic Graphs. Graphs Comb. 36(5): 1545-1562 (2020) - [j78]Fangfang Wu, Shenggui Zhang, Binlong Li:
Sub-Ramsey Numbers for Matchings. Graphs Comb. 36(6): 1675-1685 (2020) - [j77]Pengfei Wan, Xinzhuang Chen, Jianhua Tu, Matthias Dehmer, Shenggui Zhang, Frank Emmert-Streib:
On graph entropy measures based on the number of independent sets and matchings. Inf. Sci. 516: 491-504 (2020) - [j76]Zhiwei Guo, Hajo Broersma, Ruonan Li, Shenggui Zhang:
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs. J. Comb. Optim. 40(4): 1008-1019 (2020) - [j75]Ruonan Li, Hajo Broersma, Shenggui Zhang:
Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs. J. Graph Theory 94(3): 476-493 (2020)
2010 – 2019
- 2019
- [j74]Pengfei Wan, Jianhua Tu, Matthias Dehmer, Shenggui Zhang, Frank Emmert-Streib:
Graph entropy based on the number of spanning forests of c-cyclic graphs. Appl. Math. Comput. 363 (2019) - [j73]Jimeng Xiao, Huajun Zhang, Shenggui Zhang:
Fractional chromatic numbers of tensor products of three graphs. Discret. Math. 342(5): 1310-1317 (2019) - [j72]Shinya Fujita, Bo Ning, Chuandong Xu, Shenggui Zhang:
On sufficient conditions for rainbow cycles in edge-colored graphs. Discret. Math. 342(7): 1956-1965 (2019) - [j71]Ruonan Li, Hajo Broersma, Shenggui Zhang:
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs. Graphs Comb. 35(1): 261-286 (2019) - [j70]Xiao Wang, You Lu, Cun-Quan Zhang, Shenggui Zhang:
Six-flows on almost balanced signed graphs. J. Graph Theory 92(4): 394-404 (2019) - [i2]Chuandong Xu, Hongna Yang, Shenggui Zhang:
A new proof on the Ramsey number of matchings. CoRR abs/1905.08456 (2019) - [i1]Chuandong Xu, Colton Magnant, Shenggui Zhang:
Properly colored $C_{4}$'s in edge-colored graphs. CoRR abs/1905.10584 (2019) - 2018
- [j69]Lu Qiao, Shenggui Zhang, Jing Li:
Coulson-type integral formulas for the general energy of polynomials with real roots. Appl. Math. Comput. 320: 202-212 (2018) - [j68]Pengfei Wan, Jianhua Tu, Shenggui Zhang, Binlong Li:
Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth. Appl. Math. Comput. 332: 42-47 (2018) - [j67]Jimeng Xiao, Jiuqiang Liu, Shenggui Zhang:
Families of vector spaces with r-wise L-intersections. Discret. Math. 341(4): 1041-1054 (2018) - [j66]Binlong Li, Hajo Broersma, Shenggui Zhang:
Conditions for graphs to be path partition optimal. Discret. Math. 341(5): 1350-1358 (2018) - [j65]Yandong Bai, Shinya Fujita, Shenggui Zhang:
Kernels by properly colored paths in arc-colored digraphs. Discret. Math. 341(6): 1523-1533 (2018) - [j64]Zhiwei Guo, Xueliang Li, Chuandong Xu, Shenggui Zhang:
Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems. Discret. Math. 341(7): 2104-2112 (2018) - [j63]Shinya Fujita, Ruonan Li, Shenggui Zhang:
Color degree and monochromatic degree conditions for short properly colored cycles in edge-colored graphs. J. Graph Theory 87(3): 362-373 (2018) - 2017
- [j62]Dan Hu, Xueliang Li, Xiaogang Liu, Shenggui Zhang:
The von Neumann entropy of random multipartite graphs. Discret. Appl. Math. 232: 201-206 (2017) - [j61]Ruonan Li, Hajo Broersma, Chuandong Xu, Shenggui Zhang:
Cycle extension in edge-colored complete graphs. Discret. Math. 340(6): 1235-1241 (2017) - 2016
- [j60]Binlong Li, Shenggui Zhang:
Heavy subgraph conditions for longest cycles to be heavy in graphs. Discuss. Math. Graph Theory 36(2): 383-392 (2016) - [j59]Hajo Broersma, Binlong Li, Shenggui Zhang:
Forbidden subgraphs for hamiltonicity of 1-tough graphs. Discuss. Math. Graph Theory 36(4): 915-929 (2016) - [j58]Chuandong Xu, Xiaoxue Hu, Weifan Wang, Shenggui Zhang:
Rainbow cliques in edge-colored graphs. Eur. J. Comb. 54: 193-200 (2016) - [j57]Jiuqiang Liu, Shenggui Zhang, Shuchao Li, Huihui Zhang:
Set systems with k-wise L-intersections and codes with restricted Hamming distances. Eur. J. Comb. 58: 166-180 (2016) - [j56]Binlong Li, Bo Ning, Shenggui Zhang:
Long Paths and Cycles Passing Through Specified Vertices Under the Average Degree Condition. Graphs Comb. 32(1): 279-295 (2016) - [j55]Bo Ning, Shenggui Zhang, Binlong Li:
Solution to a Problem on Hamiltonicity of Graphs Under Ore- and Fan-Type Heavy Subgraph Conditions. Graphs Comb. 32(3): 1125-1135 (2016) - [j54]Ruonan Li, Bo Ning, Shenggui Zhang:
Color Degree Sum Conditions for Rainbow Triangles in Edge-Colored Graphs. Graphs Comb. 32(5): 2001-2008 (2016) - 2015
- [j53]Chuandong Xu, Shenggui Zhang, Bo Ning, Binlong Li:
A note on the number of spanning trees of line digraphs. Discret. Math. 338(5): 688-694 (2015) - [j52]Binlong Li, Shenggui Zhang:
Forbidden subgraphs for longest cycles to contain vertices with large degrees. Discret. Math. 338(10): 1681-1689 (2015) - [j51]Binlong Li, Bo Ning, Hajo Broersma, Shenggui Zhang:
Characterizing Heavy Subgraph Pairs for Pancyclicity. Graphs Comb. 31(3): 649-667 (2015) - [j50]Chuandong Xu, Shenggui Zhang, Yi Wang:
On the maximum arc-chromatic number of digraphs with bounded outdegrees or indegrees. Inf. Process. Lett. 115(12): 939-944 (2015) - 2014
- [j49]Bo Ning, Shenggui Zhang, Bing Chen:
Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs. Discret. Math. Algorithms Appl. 6(3) (2014) - [j48]Hajo Broersma, Binlong Li, Shenggui Zhang:
Heavy subgraph pairs for traceability of block-chains. Discuss. Math. Graph Theory 34(2): 287-307 (2014) - [j47]Binlong Li, Bo Ning, Chuandong Xu, Shenggui Zhang:
Rainbow triangles in edge-colored graphs. Eur. J. Comb. 36: 453-459 (2014) - 2013
- [j46]Chuandong Xu, Shenggui Zhang, You Lu:
Covering digraphs with small indegrees or outdegrees by directed cuts. Discret. Math. 313(16): 1648-1654 (2013) - [j45]Bo Ning, Shenggui Zhang:
Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs. Discret. Math. 313(17): 1715-1725 (2013) - [j44]Binlong Li, Hajo Broersma, Shenggui Zhang:
Forbidden subgraph pairs for traceability of block-chains. Electron. J. Graph Theory Appl. 1(1): 1-10 (2013) - 2012
- [j43]Binlong Li, Shenggui Zhang:
Notes on heavy cycles in weighted digraphs. Appl. Math. Lett. 25(11): 1629-1631 (2012) - [j42]Hongbo Hua, Shenggui Zhang, Kexiang Xu:
Further results on the eccentric distance sum. Discret. Appl. Math. 160(1-2): 170-180 (2012) - [j41]Hongbo Hua, Shenggui Zhang:
On the reciprocal degree distance of graphs. Discret. Appl. Math. 160(7-8): 1152-1163 (2012) - [j40]Yandong Bai, Binlong Li, Shenggui Zhang:
Covering the edges of digraphs in D(3, 3) and D(4, 4) with directed cuts. Discret. Math. 312(10): 1596-1601 (2012) - [j39]Jan Ekstein, Premysl Holub, Tomás Kaiser, Liming Xiong, Shenggui Zhang:
Star subdivisions and connected even factors in the square of a graph. Discret. Math. 312(17): 2574-2578 (2012) - [j38]Binlong Li, Hajo Broersma, Shenggui Zhang:
Pairs of forbidden induced subgraphs for homogeneously traceable graphs. Discret. Math. 312(18): 2800-2818 (2012) - [j37]Shengning Qiao, Shenggui Zhang:
Spanning Cyclic Subdivisions of Vertex-Disjoint Cycles and Chorded Cycles in Graphs. Graphs Comb. 28(2): 277-285 (2012) - [j36]Binlong Li, Zdenek Ryjácek, Ying Wang, Shenggui Zhang:
Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs. SIAM J. Discret. Math. 26(3): 1088-1103 (2012) - [j35]Shubin Si, Hongyan Dui, Xibin Zhao, Shenggui Zhang, Shudong Sun:
Integrated Importance Measure of Component States Based on Loss of System Performance. IEEE Trans. Reliab. 61(1): 192-202 (2012) - 2011
- [j34]Binlong Li, Shenggui Zhang:
Heavy cycles and spanning trees with few leaves in weighted graphs. Appl. Math. Lett. 24(6): 908-910 (2011) - [j33]Hongbo Hua, Shenggui Zhang:
Graphs with given number of cut vertices and extremal Merrifield-Simmons index. Discret. Appl. Math. 159(10): 971-980 (2011) - [c8]Bolin Chen, Yan Yan, Jin-Hong Shi, Shenggui Zhang, Fang-Xiang Wu:
An Improved Graph Entropy-based Method for Identifying Protein Complexes. BIBM 2011: 123-126 - 2010
- [j32]Shubin Si, Zhiqiang Cai, Shudong Sun, Shenggui Zhang:
Integrated importance measures of multi-state systems under uncertainty. Comput. Ind. Eng. 59(4): 921-928 (2010) - [j31]Yinkui Li, Shenggui Zhang:
Extremal graphs with given order and the rupture degree. Comput. Math. Appl. 60(6): 1706-1710 (2010) - [j30]Binlong Li, Shenggui Zhang:
On extremal weighted digraphs with no heavy paths. Discret. Math. 310(10-11): 1640-1644 (2010) - [j29]Shengning Qiao, Shenggui Zhang:
Vertex-disjoint chorded cycles in a graph. Oper. Res. Lett. 38(6): 564-566 (2010) - [c7]Wu Jiang, Shenggui Zhang:
Computing the connectivity indices of α- and β-cyclodextrins. BIBM Workshops 2010: 107-112 - [c6]Bing Chen, Shenggui Zhang:
Computing the Scattering Number of Bicyclic Graphs. CIS 2010: 497-500
2000 – 2009
- 2009
- [j28]T. C. Edwin Cheng, Yonglin Guo, Shenggui Zhang, Yongjun Du:
Extreme values of the sum of squares of degrees of bipartite graphs. Discret. Math. 309(6): 1557-1564 (2009) - [j27]Bing Chen, Shenggui Zhang, Shengning Qiao:
Hamilton cycles in claw-heavy graphs. Discret. Math. 309(8): 2015-2019 (2009) - [j26]Shengning Qiao, Shenggui Zhang:
Degree sum conditions for oriented forests in digraphs. Discret. Math. 309(13): 4642-4645 (2009) - 2008
- [j25]Zongtian Wei, Shenggui Zhang:
Vertex-Neighbor-Integrity of Composition Graphs of Paths. Ars Comb. 86 (2008) - [j24]Bing Chen, Shenggui Zhang:
A New s3 Type Condition for Heavy Cycles in Weighted Graphs. Ars Comb. 87 (2008) - [j23]Bing Chen, Shenggui Zhang, T. C. Edwin Cheng:
Heavy cycles in k-connected weighted graphs with large weighted degree sums. Discret. Math. 308(20): 4531-4543 (2008) - [j22]Yinkui Li, Shenggui Zhang, Qilong Zhang:
Vulnerability parameters of split graphs. Int. J. Comput. Math. 85(1): 19-23 (2008) - [j21]Zongtian Wei, Shenggui Zhang:
Vertex-neighbour-integrity of composition graphs of paths and cycles. Int. J. Comput. Math. 85(5): 727-733 (2008) - 2007
- [j20]Shenggui Zhang, Huiling Lin:
Algorithms for symmetric groups of simplexes. Appl. Math. Comput. 188(2): 1610-1634 (2007) - [j19]Jun Fujisawa, Liming Xiong, Kiyoshi Yoshimoto, Shenggui Zhang:
The upper bound of the number of cycles in a 2-factor of a line graph. J. Graph Theory 55(1): 72-82 (2007) - [c5]Shuying Peng, Meili Li, Shenggui Zhang, T. C. Edwin Cheng:
Some New Structural Properties of Shortest 2-Connected Steiner Networks. FAW 2007: 317-324 - [c4]Bing Chen, Shenggui Zhang, T. C. Edwin Cheng:
Heavy Cycles in 2-Connected Weighted Graphs with Large Weighted Degree Sums. International Conference on Computational Science (3) 2007: 338-346 - 2006
- [j18]Qilong Zhang, Shenggui Zhang:
Edge vulnerability parameters of split graphs. Appl. Math. Lett. 19(9): 916-920 (2006) - [j17]Bing Chen, Shenggui Zhang:
An implicit degree condition for long cycles in 2-connected graphs. Appl. Math. Lett. 19(11): 1148-1151 (2006) - 2005
- [j16]Hajo Broersma, Xueliang Li, Gerhard J. Woeginger, Shenggui Zhang:
Paths and cycles in colored graphs. Australas. J Comb. 31: 299-312 (2005) - [j15]Yinkui Li, Shenggui Zhang, Xueliang Li:
Rupture degree of graphs. Int. J. Comput. Math. 82(7): 793-803 (2005) - [j14]Jun Fujisawa, Kiyoshi Yoshimoto, Shenggui Zhang:
Heavy cycles passing through some specified vertices in weighted graphs. J. Graph Theory 49(2): 93-103 (2005) - [c3]Bing Chen, Shenggui Zhang, T. C. Edwin Cheng:
An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs. CJCDGCGT 2005: 21-29 - [c2]Genjiu Xu, Xueliang Li, Shenggui Zhang:
The Binding Number of a Digraph. CJCDGCGT 2005: 221-227 - 2004
- [j13]Shenggui Zhang, Sui Sun Cheng:
Gröbner basis for an ideal of a polynomial ring over an algebraic extension over a field and its applications. Appl. Math. Comput. 153(1): 27-58 (2004) - [j12]Ligong Wang, Xueliang Li, Shenggui Zhang:
Families of integral trees with diameters 4, 6, and 8. Discret. Appl. Math. 136(2-3): 349-362 (2004) - [j11]Haixing Zhao, Xueliang Li, Shenggui Zhang, Ruying Liu:
On the minimum real roots of the -polynomials and chromatic uniqueness of graphs. Discret. Math. 281(1-3): 277-294 (2004) - [j10]Shenggui Zhang, Bing Chen, Rongzu Yu:
Heavy cycles in k-connected weighted graphs. Electron. Notes Discret. Math. 17: 293-296 (2004) - [j9]Shenggui Zhang, Shuying Peng:
Relationships between scattering number and other vulnerability parameters. Int. J. Comput. Math. 81(3): 291-298 (2004) - [c1]Shenggui Zhang, Bing Chen, Rongzu Yu:
Heavy Cycles in k-connected Weighted Graphs. CTW 2004: 253-256 - 2002
- [j8]Shenggui Zhang, Hajo Broersma, Xueliang Li, Ligong Wang:
A Fan Type Condition For Heavy Cycles in Weighted Graphs. Graphs Comb. 18(1): 193-200 (2002) - [j7]Shenggui Zhang, Xueliang Li, Xinglou Han:
Computing the Scattering Number of Graphs. Int. J. Comput. Math. 79(2): 179-187 (2002) - 2001
- [j6]Hajo Broersma, Xueliang Li, Shenggui Zhang:
A σ3 type condition for heavy cycles in weighted graphs. Discuss. Math. Graph Theory 21(2): 159-166 (2001) - [j5]Ligong Wang, Xueliang Li, Shenggui Zhang:
Some New Families of Integral Trees with Diameters 4 and 6. Electron. Notes Discret. Math. 8: 119-123 (2001) - [j4]Xueliang Li, Shenggui Zhang, Hajo Broersma:
Paths and Cycles in Colored Graphs. Electron. Notes Discret. Math. 8: 128-132 (2001) - [j3]Hao Sun, Shenggui Zhang, Xueliang Li, Theo S. H. Driessen, Cornelis Hoede:
A Co-Marginalistic Contribution Value for Set Games. IGTR 3(4): 351-362 (2001) - [j2]Shenggui Zhang, Ziguo Wang:
Scattering number in graphs. Networks 37(2): 102-106 (2001) - 2000
- [j1]Shenggui Zhang, Xueliang Li, Hajo Broersma:
Heavy paths and cycles in weighted graphs. Discret. Math. 223(1-3): 327-336 (2000)
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-10-07 21:18 CEST 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:
