Lingsheng Shi

According to our database, Lingsheng Shi authored at least 18 papers between 2003 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

A sufficient condition for edge 6-colorable planar graphs with maximum degree 6.

Zhengrong Lu, Lingsheng Shi

Discret. Appl. Math., 2022

2018

Geodesic cycles in random graphs.

Yuanzhi Li, Lingsheng Shi

Discret. Math., 2018

Signed Cycle Double Covers.

Lingsheng Shi, Zhang Zhang

Electron. J. Comb., 2018

2017

The complexity of problems in wireless communication.

Lingsheng Shi, Huandong Wang

Telecommun. Syst., 2017

Characterizing rules in minimum cost spanning tree problems.

Lingsheng Shi, Boya Yu

Oper. Res. Lett., 2017

Large Induced Forests in Graphs.

Lingsheng Shi, Hongyu Xu

J. Graph Theory, 2017

2016

On Turán densities of small triple graphs.

Lingsheng Shi

Eur. J. Comb., 2016

2014

Packing Triangles in K 4-Free Graphs.

Shunchang Huang, Lingsheng Shi

Graphs Comb., 2014

2013

Graphs with Small Independence Number Minimizing the spectral radius.

Xue Du, Lingsheng Shi

Discret. Math. Algorithms Appl., 2013

2010

Ramsey numbers of long cycles versus books or wheels.

Lingsheng Shi

Eur. J. Comb., 2010

2009

Bounds on Randic indices.

Lingsheng Shi

Discret. Math., 2009

On graphs with given main eigenvalues.

Lingsheng Shi

Appl. Math. Lett., 2009

2007

The tail is cut for Ramsey numbers of cubes.

Lingsheng Shi

Discret. Math., 2007

Colouring Random Regular Graphs.

Lingsheng Shi, Nicholas C. Wormald

Comb. Probab. Comput., 2007

Colouring Random 4-Regular Graphs.

Lingsheng Shi, Nicholas C. Wormald

Comb. Probab. Comput., 2007

2005

Linear Ramsey numbers of sparse graphs.

Lingsheng Shi

J. Graph Theory, 2005

2003

Numbers and topologies

Lingsheng Shi

PhD thesis, 2003

Upper bounds for Ramsey numbers.

Lingsheng Shi

Discret. Math., 2003