Jiansheng Cai

From MaRDI portal
(Redirected from Person:477485)


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
CLBA: a Coulomb's law based algorithm for community detection in directed networks
Physica A
2024-09-19Paper
A note on the independence and fractional matching numbers in random graphs
Advances in Mathematics (Beijing)
2024-07-29Paper
Second neighborhood via probabilistic argument
Discrete Applied Mathematics
2024-05-06Paper
\(\mathrm{Quasi}_{\mathrm{ps}}\)-pancyclicity of regular multipartite tournament
Graphs and Combinatorics
2023-08-21Paper
Majority choosability of 1-planar digraph
Czechoslovak Mathematical Journal
2023-08-17Paper
List injective coloring of planar graphs
Applied Mathematics and Computation
2023-05-31Paper
Acyclic list edge coloring of graphs with maximum degree 4
 
2022-09-29Paper
随机图的$f$-染色的分类 II
 
2022-09-29Paper
Acyclic coloring of claw-free graphs with small degree
Discrete Applied Mathematics
2022-09-15Paper
List injective coloring of planar graphs
Acta Mathematicae Applicatae Sinica. English Series
2022-07-15Paper
List injective coloring of planar graphs with disjoint \(5^-\)-cycles
Discrete Mathematics, Algorithms and Applications
2022-06-21Paper
Neighbor sum distinguishing index of sparse graphs
Acta Mathematica Sinica, English Series
2020-09-07Paper
The classification of \(f\)-coloring of random graphs
 
2020-01-22Paper
Improved upper bound for acyclic chromatic number of graphs.
 
2019-12-18Paper
An upper bound for the choice number of star edge coloring of graphs
Applied Mathematics and Computation
2019-11-26Paper
\({K_4}\)-factors in random graphs
 
2019-10-02Paper
The classification of \(f\)-coloring of graphs with large maximum degree
Applied Mathematics and Computation
2019-04-29Paper
Improved upper bound for generalized acyclic chromatic number of graphs
Acta Mathematicae Applicatae Sinica. English Series
2018-11-07Paper
Classification of \(f\)-colorings of graphs with some restrictions
 
2017-10-20Paper
On the existence of \(\left[ {k,k + 1} \right\)-factors in random graphs]
 
2017-10-20Paper
Improved upper bound for the degenerate and star chromatic numbers of graphs
Journal of Combinatorial Optimization
2017-10-17Paper
Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
Theoretical Computer Science
2017-01-09Paper
An independent number condition for the existence of \(k\)-uniform graphs
 
2016-08-10Paper
Acyclic coloring of graphs with some girth restriction
Journal of Combinatorial Optimization
2016-05-11Paper
Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
Discrete Applied Mathematics
2016-05-02Paper
List edge coloring of planar graphs without non-induced 6-cycles
Graphs and Combinatorics
2015-07-20Paper
scientific article; zbMATH DE number 6403946 (Why is no real title available?)
 
2015-02-16Paper
A note on the existence of fractional \(f\)-factors in random graphs
Acta Mathematicae Applicatae Sinica. English Series
2014-12-09Paper
Total coloring of planar graphs without 7-cycles with chords
Acta Mathematicae Applicatae Sinica
2014-11-03Paper
A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
Acta Mathematica Sinica, English Series
2014-06-11Paper
\(f\)-class two graphs whose \(f\)-cores have maximum degree two
Acta Mathematica Sinica, English Series
2014-06-03Paper
A degree condition for the existence of connected \([k, k + 1\)-factors with prescribed properties]
Utilitas Mathematica
2014-01-21Paper
Total coloring of planar graphs with maximum degree 8 and without specified subgraphs
Acta Mathematicae Applicatae Sinica
2013-11-19Paper
The generalized acyclic chromatic number of graphs with large girth
Acta Mathematica Sinica. Chinese Series
2013-11-19Paper
A degree condition for \(k\)-uniform graphs
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing
2013-07-12Paper
A toughness condition for the existence of \(f\)-factors in graphs
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing
2013-07-12Paper
Some results on \((g,f)\)-uniform graphs
Utilitas Mathematica
2013-07-12Paper
Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles
Graphs and Combinatorics
2013-06-26Paper
Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
Science China. Mathematics
2013-01-28Paper
Edge-choosability of planar graphs without chordal 7-cycles.
 
2012-10-12Paper
Edge-choosability of planar graphs without chordal 6-cycles
Utilitas Mathematica
2012-07-02Paper
A new sufficient condition for graphs of \(f\)-class 1.
 
2012-02-20Paper
Toughness and existence of fractional \((g,f)\)-factors in graphs
 
2011-06-29Paper
A note on edge-choosability of planar graphs without intersecting 4-cycles
Journal of Applied Mathematics and Computing
2011-06-22Paper
Stability number and \(f\)-factor in \(K_{1,n}\)-free graphs
 
2011-02-02Paper
Edge-choosability of planar graphs without non-induced 5-cycles
Information Processing Letters
2010-06-16Paper
Degree and stability number condition for the existence of connected factors in graphs
Journal of Applied Mathematics and Computing
2009-10-26Paper
The stability number and connected \([k,k+1\)-factor in graphs]
Applied Mathematics Letters
2009-06-10Paper
Edge-choosability of planar graphs without adjacent triangles or without 7-cycles
Discrete Mathematics
2009-01-28Paper
scientific article; zbMATH DE number 5383193 (Why is no real title available?)
 
2008-12-18Paper
Binding number and Hamiltonian (g, f)-factors in graphs II
International Journal of Computer Mathematics
2008-09-24Paper
Binding number and Hamiltonian \((g,f)\)-factors in graphs
Journal of Applied Mathematics and Computing
2008-02-22Paper
Some results about f‐critical graphs
Networks
2008-01-07Paper
scientific article; zbMATH DE number 5138378 (Why is no real title available?)
 
2007-03-29Paper
List edge and list total colorings of planar graphs without 4-cycles
Theoretical Computer Science
2007-01-09Paper


Research outcomes over time


This page was built for person: Jiansheng Cai