Jiansheng Cai

Orcid: 0000-0001-9550-7063

According to our database1, Jiansheng Cai authored at least 27 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Quasi <sub>rmps</sub>-Pancyclicity of Regular Multipartite Tournament.
Graphs Comb., August, 2023

List injective coloring of planar graphs.
Appl. Math. Comput., 2023

2022
List injective coloring of planar graphs with disjoint 5--cycles.
Discret. Math. Algorithms Appl., 2022

Acyclic coloring of claw-free graphs with small degree.
Discret. Appl. Math., 2022

DriverRWH: discovering cancer driver genes by random walk on a gene mutation hypergraph.
BMC Bioinform., 2022

2021
Measurement of Tremor on Arteriovenous Fistulas with a Flexible Capacitive Sensor.
Proceedings of the 43rd Annual International Conference of the IEEE Engineering in Medicine & Biology Society, 2021

2020
Establishing UAV-Aided VBSs for Secure Multicasting.
IEEE Wirel. Commun. Lett., 2020

2019
An upper bound for the choice number of star edge coloring of graphs.
Appl. Math. Comput., 2019

Deep Neural Networks for CSI-Based Authentication.
IEEE Access, 2019

2018
Supervised and Semi-Supervised Deep Neural Networks for CSI-Based Authentication.
CoRR, 2018

2017
Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles.
Theor. Comput. Sci., 2017

Improved upper bound for the degenerate and star chromatic numbers of graphs.
J. Comb. Optim., 2017

The classification of f-coloring of graphs with large maximum degree.
Appl. Math. Comput., 2017

2016
Acyclic coloring of graphs with some girth restriction.
J. Comb. Optim., 2016

Neighbor sum distinguishing total choosability of planar graphs without 4-cycles.
Discret. Appl. Math., 2016

2015
List Edge Coloring of Planar Graphs Without Non-Induced 6-Cycles.
Graphs Comb., 2015

2011
Edge-choosability of planar graphs without chordal 7-Cycles.
Ars Comb., 2011

2009
Edge-choosability of planar graphs without non-induced 5-cycles.
Inf. Process. Lett., 2009

Edge-choosability of planar graphs without adjacent triangles or without 7-cycles.
Discret. Math., 2009

Toughness and Existence of Fractional (g, f)-factors in Graphs.
Ars Comb., 2009

The stability number and connected [k, k+1]-factor in graphs.
Appl. Math. Lett., 2009

2008
Binding number and Hamiltonian (<i>g, f</i>)-factors in graphs II.
Int. J. Comput. Math., 2008

Stability Number and f-factor in K<sub>1, n</sub>-free Graphs.
Ars Comb., 2008

2007
Some results about <i>f</i>-critical graphs.
Networks, 2007

Binding Number and Connected ( <i>g</i> , <i>f</i> + 1)-Factors in Graphs.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

2006
List edge and list total colorings of planar graphs without 4-cycles.
Theor. Comput. Sci., 2006

Stability Number and Fractional F-factors in Graphs.
Ars Comb., 2006


  Loading...