Yingli Kang

From MaRDI portal


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
Planar graphs having no cycle of length 4, 7, or 9 are DP-3-colorable
Journal of Graph Theory
2024-09-16Paper
(I,F)-partition of planar graphs without cycles of length 4, 6, or 9
 
2023-03-08Paper
DP-3-colorability of planar graphs without cycles of length 4, 7 or 9
 
2023-03-08Paper
A study on parity signed graphs: the \(rna\) number
Applied Mathematics and Computation
2022-07-11Paper
\((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\)
Discrete Mathematics
2022-02-14Paper
Planar graphs without cycles of length from 4 to 6 are \((1,0,0)\)-colorable
SCIENTIA SINICA Mathematica
2021-12-17Paper
A sufficient condition for a planar graph to be 3-colorable
SCIENTIA SINICA Mathematica
2021-12-17Paper
A study on parity signed graphs: the $rna$ number
 
2021-11-08Paper
Partially normal 5-edge-colorings of cubic graphs
European Journal of Combinatorics
2021-06-18Paper
Circular coloring of signed graphs
Journal of Graph Theory
2018-02-23Paper
Hajós-like theorem for signed graphs
European Journal of Combinatorics
2017-10-10Paper
Plane graphs without 4- and 5-cycles and without ext-triangular 7-cycles are 3-colorable
SIAM Journal on Discrete Mathematics
2017-08-31Paper
Face-degree bounds for planar critical graphs
The Electronic Journal of Combinatorics
2016-09-13Paper
The chromatic spectrum of signed graphs
Discrete Mathematics
2016-07-05Paper
Soliton solution to BKP equation in Wronskian form
Applied Mathematics and Computation
2016-04-27Paper
Remarks on planar edge-chromatic critical graphs
Discrete Applied Mathematics
2016-01-21Paper
Choosability in signed planar graphs
European Journal of Combinatorics
2015-12-11Paper
The 3-colorability of planar graphs without cycles of length 4, 6 and 9
Discrete Mathematics
2015-10-08Paper
Distance constraints on short cycles for 3-colorability of planar graphs
Graphs and Combinatorics
2015-09-24Paper
Generalized Wronskian solutions for the \((3+1)\)-dimensional Jimbo-Miwa equation
Applied Mathematics and Computation
2015-03-23Paper


Research outcomes over time


This page was built for person: Yingli Kang