Jian-Sheng Cai

From MaRDI portal
Revision as of 20:47, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:477485

Available identifiers

zbMath Open cai.jianshengMaRDI QIDQ477485

List of research outcomes





PublicationDate of PublicationType
CLBA: a Coulomb's law based algorithm for community detection in directed networks2024-09-19Paper
A note on the independence and fractional matching numbers in random graphs2024-07-29Paper
Second neighborhood via probabilistic argument2024-05-06Paper
\(\mathrm{Quasi}_{\mathrm{ps}}\)-pancyclicity of regular multipartite tournament2023-08-21Paper
Majority choosability of 1-planar digraph2023-08-17Paper
List injective coloring of planar graphs2023-05-31Paper
随机图的$f$-染色的分类 II2022-09-29Paper
https://portal.mardi4nfdi.de/entity/Q50379792022-09-29Paper
Acyclic coloring of claw-free graphs with small degree2022-09-15Paper
List injective coloring of planar graphs2022-07-15Paper
List injective coloring of planar graphs with disjoint 5−-cycles2022-06-21Paper
Neighbor sum distinguishing index of sparse graphs2020-09-07Paper
https://portal.mardi4nfdi.de/entity/Q52098282020-01-22Paper
https://portal.mardi4nfdi.de/entity/Q52064332019-12-18Paper
An upper bound for the choice number of star edge coloring of graphs2019-11-26Paper
https://portal.mardi4nfdi.de/entity/Q51961172019-10-02Paper
The classification of \(f\)-coloring of graphs with large maximum degree2019-04-29Paper
Improved upper bound for generalized acyclic chromatic number of graphs2018-11-07Paper
https://portal.mardi4nfdi.de/entity/Q53676182017-10-20Paper
https://portal.mardi4nfdi.de/entity/Q53685352017-10-20Paper
Improved upper bound for the degenerate and star chromatic numbers of graphs2017-10-17Paper
Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles2017-01-09Paper
https://portal.mardi4nfdi.de/entity/Q29920942016-08-10Paper
Acyclic coloring of graphs with some girth restriction2016-05-11Paper
Neighbor sum distinguishing total choosability of planar graphs without 4-cycles2016-05-02Paper
List edge coloring of planar graphs without non-induced 6-cycles2015-07-20Paper
https://portal.mardi4nfdi.de/entity/Q51737222015-02-16Paper
A note on the existence of fractional \(f\)-factors in random graphs2014-12-09Paper
https://portal.mardi4nfdi.de/entity/Q29243682014-11-03Paper
A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable2014-06-11Paper
\(f\)-class two graphs whose \(f\)-cores have maximum degree two2014-06-03Paper
https://portal.mardi4nfdi.de/entity/Q28709652014-01-21Paper
https://portal.mardi4nfdi.de/entity/Q28598062013-11-19Paper
https://portal.mardi4nfdi.de/entity/Q28598632013-11-19Paper
https://portal.mardi4nfdi.de/entity/Q28396782013-07-12Paper
https://portal.mardi4nfdi.de/entity/Q28397362013-07-12Paper
https://portal.mardi4nfdi.de/entity/Q28397472013-07-12Paper
Linear 2-arboricity of planar graphs with neither 3-cycles nor adjacent 4-cycles2013-06-26Paper
Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable2013-01-28Paper
https://portal.mardi4nfdi.de/entity/Q31664452012-10-12Paper
https://portal.mardi4nfdi.de/entity/Q28953872012-07-02Paper
https://portal.mardi4nfdi.de/entity/Q31150752012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q30118172011-06-29Paper
A note on edge-choosability of planar graphs without intersecting 4-cycles2011-06-22Paper
https://portal.mardi4nfdi.de/entity/Q30703572011-02-02Paper
Edge-choosability of planar graphs without non-induced 5-cycles2010-06-16Paper
Degree and stability number condition for the existence of connected factors in graphs2009-10-26Paper
The stability number and connected \([k,k+1\)-factor in graphs]2009-06-10Paper
Edge-choosability of planar graphs without adjacent triangles or without 7-cycles2009-01-28Paper
https://portal.mardi4nfdi.de/entity/Q35459902008-12-18Paper
Binding number and Hamiltonian (g, f)-factors in graphs II2008-09-24Paper
Binding number and Hamiltonian \((g,f)\)-factors in graphs2008-02-22Paper
Some results about f‐critical graphs2008-01-07Paper
https://portal.mardi4nfdi.de/entity/Q34286722007-03-29Paper
List edge and list total colorings of planar graphs without 4-cycles2007-01-09Paper

Research outcomes over time

This page was built for person: Jian-Sheng Cai