Jingjing Tian

Available identifiers

zbMath Open tian.jingjingMaRDI QIDQ2296515

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5098864	2022-08-31	Paper
https://portal.mardi4nfdi.de/entity/Q4984329	2021-04-26	Paper
Dynamics modeling and analysis of SIS epidemic spreading in cluster networks	2020-02-18	Paper
https://portal.mardi4nfdi.de/entity/Q2993067	2016-08-10	Paper
Light triangles in plane graphs with near-independent crossings	2016-06-10	Paper
https://portal.mardi4nfdi.de/entity/Q4982939	2015-04-13	Paper
Upper bound on 2-strong edge chromatic numbers of graphs	2014-11-03	Paper
An algorithm for general adjacent vertex-distinguishing total colorings of some graphs and its realization in MATLAB	2014-11-03	Paper
Total coloring of planar graphs without adjacent chordal 5-cycles	2013-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q4901846	2013-01-24	Paper
Adjacent vertex-distinguishing VE-total chromatic numbers of the crown graphs \(C_m\cdot F_n\) and \(C_m\cdot C_n\)	2012-10-05	Paper
The 2-strong edge-coloring of some general crown graphs of circles	2012-06-01	Paper
One the upper bound of the \(D\)(2)-vertex-distinguishing chromatic numbers of graphs	2010-11-05	Paper
One upper bound on the \(D(2)\)-vertex-distinguishing chromatic numbers of graphs	2010-02-12	Paper
The \(D (2)\)-vertex-distinguishing proper edge-coloring chromatic number of \(C_m \cdot S_n\)	2009-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q3640169	2009-11-11	Paper
The chromatic number of adjacent-position distinguishable edge coloring of multi-joined graph \(S_m \vee P_n \vee P_n\)	2008-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q3436733	2007-05-11	Paper
https://portal.mardi4nfdi.de/entity/Q3431190	2007-04-05	Paper

Research outcomes over time

This page was built for person: Jingjing Tian