Jinghan Xu

According to our database, Jinghan Xu authored at least 9 papers between 2013 and 2023.

Collaborative distances:

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

2023

A robust VVC video encryption scheme based on the dynamical chaotification model.

Chen Chen, Xingjun Wang, Jinghan Xu

J. King Saud Univ. Comput. Inf. Sci., October, 2023

2018

EEG Emotion Classification Based On Baseline Strategy.

Jinghan Xu, Fuji Ren, Yanwei Bao

Proceedings of the 5th IEEE International Conference on Cloud Computing and Intelligence Systems, 2018

2017

Every planar graph without cycles of length 4 or 9 is (1, 1, 0)-colorable.

Lifeng Dai, Yingqian Wang, Jinghan Xu

Discret. Math., 2017

2016

Planar graphs without cycles of length 4 or 5 are (2, 0, 0)-colorable.

Ming Chen, Yingqian Wang, Peipei Liu, Jinghan Xu

Discret. Math., 2016

2015

(1, 0, 0)-Colorability of planar graphs without prescribed short cycles.

Yuehua Bu, Jinghan Xu, Yingqian Wang

J. Comb. Optim., 2015

Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph.

Yingqian Wang, Jinghan Xu

Eur. J. Comb., 2015

2014

Improper colorability of planar graphs without prescribed short cycles.

Yingqian Wang, Jinghan Xu

Discret. Math., 2014

Planar graphs with cycles of length neither 4 nor 7 are (3, 0, 0)-colorable.

Huihui Li, Jinghan Xu, Yingqian Wang

Discret. Math., 2014

2013

Planar graphs with cycles of length neither 4 nor 6 are (2, 0, 0)(2, 0, 0)-colorable.

Yingqian Wang, Jinghan Xu

Inf. Process. Lett., 2013