Jiangxu Kong

20 papers Journal 20
YearRankTypeTitle / Venue / Authors
2026 J jnl
A note on the r-hued coloring of planar graphs.
Discret. Math.
Xiaoxue Hu, Jiangxu Kong, Wei-Fan Wang, Wanshun Yang
2026 J jnl
Structural properties of LIC-planar graphs.
Discret. Appl. Math.
Juan Liu, Jiangxu Kong, Wanshun Yang, Haoying Yuan
2025 J jnl
1-Planar graphs with no 5-cycles are 5-degenerate.
Appl. Math. Comput.
Qingqin Wu, Weifan Wang, Jiangxu Kong
2025 J jnl
Dynamic coloring of IC-planar graphs.
Discret. Appl. Math.
Xiaoxue Hu, Jiangxu Kong, Weifan Wang, Wanshun Yang
2024 J jnl
An improved upper bound on the edge-face coloring of 2-connected plane graphs.
Discret. Math.
Juan Liu, Xiaoxue Hu, Jiangxu Kong
2024 J jnl
Partitioning planar graphs into bounded degree forests.
Appl. Math. Comput.
Yang Wang, Jiali Wang, Weifan Wang, Jiangxu Kong
2023 J jnl
Coloring the square of maximal planar graphs with diameter two.
Appl. Math. Comput.
Yiqiao Wang, Jingjing Huo, Jiangxu Kong, Qiuyue Tan
2023 J jnl
Plane graphs of diameter two are 2-optimal.
Appl. Math. Comput.
Jiangxu Kong, Yiqiao Wang, Jiacheng Hu, Yang Wang, Weifan Wang
2023 J jnl
The linear 2-arboricity of IC-planar graphs.
Discret. Appl. Math.
Juan Liu, Xiaoxue Hu, Dongdong Zhang, Jiangxu Kong
2022 J jnl
The Surviving Rate of IC-Planar Graphs.
Symmetry
Xiaoxue Hu, Jiacheng Hu, Jiangxu Kong
2020 J jnl
Plane graphs with Δ =7 are entirely 10-colorable.
J. Comb. Optim.
Jiangxu Kong, Xiaoxue Hu, Yiqiao Wang
2018 J jnl
Linear list r-hued coloring of sparse graphs.
Discret. Math. Algorithms Appl.
Hongping Ma, Xiaoxue Hu, Jiangxu Kong, Murong Xu
2018 J jnl
Linear list r-hued colorings of graphs with bounded maximum subgraph average degrees.
Ars Comb.
Jiangxu Kong, Suohai Fan, Hong-Jian Lai, Murong Xu
2017 J jnl
A note on the surviving rate of 1-planar graphs.
Discret. Math.
Jiangxu Kong, Lianzhu Zhang
2016 J jnl
The 2-surviving rate of planar graphs without 5-cycles.
J. Comb. Optim.
Tingting Wu, Jiangxu Kong, Wei-Fan Wang
2014 J jnl
Structural properties and surviving rate of planar graphs.
Discret. Math. Algorithms Appl.
Jiangxu Kong, Lianzhu Zhang, Wei-Fan Wang
2014 J jnl
The 2-surviving rate of planar graphs without 6-cycles.
Theor. Comput. Sci.
Weifan Wang, Stephen Finbow, Jiangxu Kong
2014 J jnl
The surviving rate of digraphs.
Discret. Math.
Jiangxu Kong, Lianzhu Zhang, Wei-Fan Wang
2012 J jnl
The 2-surviving rate of planar graphs without 4-cycles.
Theor. Comput. Sci.
Weifan Wang, Jiangxu Kong, Lianzhu Zhang
2012 J jnl
The surviving rate of planar graphs.
Theor. Comput. Sci.
Jiangxu Kong, Weifan Wang, Xuding Zhu