Jiangxu Kong

According to our database, Jiangxu Kong authored at least 14 papers between 2012 and 2023.

Collaborative distances:

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

2023

Coloring the square of maximal planar graphs with diameter two.

Yiqiao Wang, Jingjing Huo, Jiangxu Kong, Qiuyue Tan

Appl. Math. Comput., December, 2023

The linear 2-arboricity of IC-planar graphs.

Juan Liu, Xiaoxue Hu, Dongdong Zhang, Jiangxu Kong

Discret. Appl. Math., October, 2023

Plane graphs of diameter two are 2-optimal.

Jiangxu Kong, Yiqiao Wang, Jiacheng Hu, Yang Wang, Weifan Wang

Appl. Math. Comput., 2023

2022

The Surviving Rate of IC-Planar Graphs.

Xiaoxue Hu, Jiacheng Hu, Jiangxu Kong

Symmetry, 2022

2020

Plane graphs with Δ =7 are entirely 10-colorable.

Jiangxu Kong, Xiaoxue Hu, Yiqiao Wang

J. Comb. Optim., 2020

2018

Linear list r-hued coloring of sparse graphs.

Hongping Ma, Xiaoxue Hu, Jiangxu Kong, Murong Xu

Discret. Math. Algorithms Appl., 2018

Linear list r-hued colorings of graphs with bounded maximum subgraph average degrees.

Jiangxu Kong, Suohai Fan, Hong-Jian Lai, Murong Xu

Ars Comb., 2018

2017

A note on the surviving rate of 1-planar graphs.

Jiangxu Kong, Lianzhu Zhang

Discret. Math., 2017

2016

The 2-surviving rate of planar graphs without 5-cycles.

Tingting Wu, Jiangxu Kong, Wei-Fan Wang

J. Comb. Optim., 2016

2014

The 2-surviving rate of planar graphs without 6-cycles.

Weifan Wang, Stephen Finbow, Jiangxu Kong

Theor. Comput. Sci., 2014

Structural properties and surviving rate of planar graphs.

Jiangxu Kong, Lianzhu Zhang, Wei-Fan Wang

Discret. Math. Algorithms Appl., 2014

The surviving rate of digraphs.

Jiangxu Kong, Lianzhu Zhang, Wei-Fan Wang

Discret. Math., 2014

2012

The 2-surviving rate of planar graphs without 4-cycles.

Weifan Wang, Jiangxu Kong, Lianzhu Zhang

Theor. Comput. Sci., 2012

The surviving rate of planar graphs.

Jiangxu Kong, Weifan Wang, Xuding Zhu

Theor. Comput. Sci., 2012