Ping Li

Orcid: 0000-0002-3518-4802

Affiliations:
  • Shaanxi Normal University, Xian, China
  • Nankai University, Center for Combinatorics, Tianjin, China (former)


According to our database1, Ping Li authored at least 14 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Constraining MC-numbers by the connectivity of complement graphs.
Discret. Math., March, 2024

Planar Turán number of the disjoint union of cycles.
Discret. Appl. Math., January, 2024

Relations of three classes of disconnected coloring.
Discret. Appl. Math., 2024

2023
Rainbow structures in a collection of graphs with degree conditions.
J. Graph Theory, October, 2023

Extremal graphs and classification of planar graphs by MC-numbers.
Discuss. Math. Graph Theory, 2023

2022
Monochromatic disconnection: Erdős-Gallai-type problems and product graphs.
J. Comb. Optim., 2022

Further results on the total monochromatic connectivity of graphs.
J. Comb. Optim., 2022

2021
Complexity results for two kinds of colored disconnections of graphs.
J. Comb. Optim., 2021

Rainbow Monochromatic k-Edge-Connection Colorings of Graphs.
Graphs Comb., 2021

Upper bounds for the MD-numbers and characterization of extremal graphs.
Discret. Appl. Math., 2021

Monochromatic disconnection of graphs.
Discret. Appl. Math., 2021

2020
Monochromatic k-edge-connection colorings of graphs.
Discret. Math., 2020

Complexity Results for the Proper Disconnection of Graphs.
Proceedings of the Frontiers in Algorithmics - 14th International Workshop, 2020

2019
Extensions of matroid covering and packing.
Eur. J. Comb., 2019


  Loading...