Pingshan Li

According to our database, Pingshan Li authored at least 27 papers between 1998 and 2026.

Collaborative distances:

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

2026

The characterization of the lower bound on the dissociation number of trees.

Pingshan Li, Jue Wu, Wei Jin, Min Xu

Discret. Math., 2026

Paired 2-disjoint path cover of burnt pancake graphs with n-3 faulty elements.

Congzhen Chen, Pingshan Li, Xianglin Liu

Discret. Appl. Math., 2026

2024

On Conditional Edge-Fault-Tolerant Strong Menger Edge Connectivity Of Folded Hypercubes.

Shijie Zhao, Pingshan Li

Comput. J., February, 2024

The maximum number of maximum generalized 4-independent sets in trees.

Pingshan Li, Min Xu

J. Graph Theory, 2024

A note on the conditional fault-tolerant strong Menger edge connectivity of regular graphs.

Pingshan Li, Min Xu, Eddie Cheng

Discret. Appl. Math., 2024

Structure connectivity and substructure connectivity of Möbius cubes.

Xiaojun Zhao, Shudan Xue, Qingying Deng, Pingshan Li

Comput. J., 2024

2023

Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges.

Shudan Xue, Qingying Deng, Pingshan Li, Jianguo Chen

Discret. Appl. Math., July, 2023

Fault-Tolerant Strongly Hamiltonian Laceability and Hyper-Hamiltonian Laceability of Cayley Graphs Generated by Transposition Trees.

Shudan Xue, Qingying Deng, Pingshan Li

Comput. J., February, 2023

2022

Component edge connectivity of hypercube-like networks.

Dong Liu, Pingshan Li, Bicheng Zhang

Theor. Comput. Sci., 2022

The 3-Good Neighbor Edge-Fault-Tolerant Strong Menger Edge Connectivity on the Class of BC Networks.

Rong Liu, Pingshan Li

J. Interconnect. Networks, 2022

The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees.

Pingshan Li, Rong Liu, Xianglin Liu

Int. J. Found. Comput. Sci., 2022

Edge fault-tolerance of strongly Menger edge connected graphs.

Pingshan Li

Discret. Math., 2022

2020

Edge-fault-tolerant strong Menger edge connectivity on regular graphs.

Min Xu, Pingshan Li

Theor. Comput. Sci., 2020

The largest component of faulty star graphs.

Pingshan Li, Min Xu

Theor. Comput. Sci., 2020

The component (edge) connectivity of shuffle-cubes.

Tongtong Ding, Pingshan Li, Min Xu

Theor. Comput. Sci., 2020

Fault-tolerant strong Menger (edge) connectivity of arrangement graph.

Pingshan Li, Min Xu

Discret. Appl. Math., 2020

2019

The <i>t</i>/<i>k</i>-diagnosability and strong Menger connectivity on star graphs with conditional faults.

Pingshan Li, Min Xu

Theor. Comput. Sci., 2019

Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults.

Pingshan Li, Min Xu

Int. J. Found. Comput. Sci., 2019

Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks.

Pingshan Li, Min Xu

Discret. Appl. Math., 2019

2018

Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes.

Pingshan Li, Min Xu

Theor. Comput. Sci., 2018

Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes.

Qi Cheng, Pingshan Li, Min Xu

Theor. Comput. Sci., 2018

2017

The Super Spanning Connectivity of Arrangement Graphs.

Pingshan Li, Min Xu

Int. J. Found. Comput. Sci., 2017

Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes.

Pingshan Li, Min Xu

Appl. Math. Comput., 2017

2002

Block Interlaced Pinwheel Error Diffusion.

Pingshan Li, Jan P. Allebach

Proceedings of the PICS 2002: IS&T's PICS Conference, 2002

Clustered minority pixel error diffusion.

Pingshan Li, Jan P. Allebach

Proceedings of the 2002 International Conference on Image Processing, 2002

Tone-dependent error diffusion.

Pingshan Li, Jan P. Allebach

Proceedings of the Color Imaging: Device-Independent Color, 2002

1998

Look-Up-Table based Halftoning Algorithm.

Pingshan Li, Jan P. Allebach

Proceedings of the 1998 IEEE International Conference on Image Processing, 1998