Jiangxu Kong

According to our database1, Jiangxu Kong authored at least 16 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An improved upper bound on the edge-face coloring of 2-connected plane graphs.
Discret. Math., 2024

Partitioning planar graphs into bounded degree forests.
Appl. Math. Comput., 2024

2023
Coloring the square of maximal planar graphs with diameter two.
Appl. Math. Comput., December, 2023

The linear 2-arboricity of IC-planar graphs.
Discret. Appl. Math., October, 2023

Plane graphs of diameter two are 2-optimal.
Appl. Math. Comput., 2023

2022
The Surviving Rate of IC-Planar Graphs.
Symmetry, 2022

2020
Plane graphs with Δ =7 are entirely 10-colorable.
J. Comb. Optim., 2020

2018
Linear list r-hued coloring of sparse graphs.
Discret. Math. Algorithms Appl., 2018

Linear list r-hued colorings of graphs with bounded maximum subgraph average degrees.
Ars Comb., 2018

2017
A note on the surviving rate of 1-planar graphs.
Discret. Math., 2017

2016
The 2-surviving rate of planar graphs without 5-cycles.
J. Comb. Optim., 2016

2014
The 2-surviving rate of planar graphs without 6-cycles.
Theor. Comput. Sci., 2014

Structural properties and surviving rate of planar graphs.
Discret. Math. Algorithms Appl., 2014

The surviving rate of digraphs.
Discret. Math., 2014

2012
The 2-surviving rate of planar graphs without 4-cycles.
Theor. Comput. Sci., 2012

The surviving rate of planar graphs.
Theor. Comput. Sci., 2012


  Loading...