Lingsheng Shi

18 papers Journal 17
YearRankTypeTitle / Venue / Authors
2022 J jnl
A sufficient condition for edge 6-colorable planar graphs with maximum degree 6.
Discret. Appl. Math.
Zhengrong Lu, Lingsheng Shi
2018 J jnl
Geodesic cycles in random graphs.
Discret. Math.
Yuanzhi Li, Lingsheng Shi
2018 J jnl
Signed Cycle Double Covers.
Electron. J. Comb.
Lingsheng Shi, Zhang Zhang
2017 J jnl
Characterizing rules in minimum cost spanning tree problems.
Oper. Res. Lett.
Lingsheng Shi, Boya Yu
2017 J jnl
Large Induced Forests in Graphs.
J. Graph Theory
Lingsheng Shi, Hongyu Xu
2017 J jnl
The complexity of problems in wireless communication.
Telecommun. Syst.
Lingsheng Shi, Huandong Wang
2016 J jnl
On Turán densities of small triple graphs.
Eur. J. Comb.
Lingsheng Shi
2014 J jnl
Packing Triangles in K 4-Free Graphs.
Graphs Comb.
Shunchang Huang, Lingsheng Shi
2013 J jnl
Graphs with Small Independence Number Minimizing the spectral radius.
Discret. Math. Algorithms Appl.
Xue Du, Lingsheng Shi
2010 J jnl
Ramsey numbers of long cycles versus books or wheels.
Eur. J. Comb.
Lingsheng Shi
2009 J jnl
Bounds on Randic indices.
Discret. Math.
Lingsheng Shi
2009 J jnl
On graphs with given main eigenvalues.
Appl. Math. Lett.
Lingsheng Shi
2007 J jnl
Colouring Random 4-Regular Graphs.
Comb. Probab. Comput.
Lingsheng Shi, Nicholas C. Wormald
2007 J jnl
Colouring Random Regular Graphs.
Comb. Probab. Comput.
Lingsheng Shi, Nicholas C. Wormald
2007 J jnl
The tail is cut for Ramsey numbers of cubes.
Discret. Math.
Lingsheng Shi
2005 J jnl
Linear Ramsey numbers of sparse graphs.
J. Graph Theory
Lingsheng Shi
2003 — —
Numbers and topologies
Lingsheng Shi
2003 J jnl
Upper bounds for Ramsey numbers.
Discret. Math.
Lingsheng Shi