Jingjing Tian

From MaRDI portal
(Redirected from Person:2296515)



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
scientific article; zbMATH DE number 7578633 (Why is no real title available?)2022-08-31Paper
Weight of light chords 4-cycles in IC-planar graphs with degree restrictions2021-04-26Paper
Dynamics modeling and analysis of SIS epidemic spreading in cluster networks
Discrete Dynamics in Nature and Society
2020-02-18Paper
Light 3-cycles in IC-planar graphs with degree restrictions2016-08-10Paper
Light triangles in plane graphs with near-independent crossings
Utilitas Mathematica
2016-06-10Paper
scientific article; zbMATH DE number 6424528 (Why is no real title available?)2015-04-13Paper
Upper bound on 2-strong edge chromatic numbers of graphs
Journal of Mathematics. Wuhan University
2014-11-03Paper
An algorithm for general adjacent vertex-distinguishing total colorings of some graphs and its realization in MATLAB
Mathematics in Practice and Theory
2014-11-03Paper
Total coloring of planar graphs without adjacent chordal 5-cycles
Utilitas Mathematica
2013-11-11Paper
The Smarandachely adjacent-vertex-edge colorings of some Mycielski's graphs2013-01-24Paper
Adjacent vertex-distinguishing VE-total chromatic numbers of the crown graphs \(C_m\cdot F_n\) and \(C_m\cdot C_n\)
Mathematics in Practice and Theory
2012-10-05Paper
The 2-strong edge-coloring of some general crown graphs of circles
Journal of Mathematics. Wuhan University
2012-06-01Paper
One the upper bound of the \(D\)(2)-vertex-distinguishing chromatic numbers of graphs2010-11-05Paper
One upper bound on the \(D(2)\)-vertex-distinguishing chromatic numbers of graphs2010-02-12Paper
The \(D (2)\)-vertex-distinguishing proper edge-coloring chromatic number of \(C_m \cdot S_n\)2009-11-11Paper
scientific article; zbMATH DE number 5629751 (Why is no real title available?)2009-11-11Paper
The chromatic number of adjacent-position distinguishable edge coloring of multi-joined graph \(S_m \vee P_n \vee P_n\)2008-08-06Paper
scientific article; zbMATH DE number 5152028 (Why is no real title available?)2007-05-11Paper
scientific article; zbMATH DE number 5140863 (Why is no real title available?)2007-04-05Paper


Research outcomes over time


This page was built for person: Jingjing Tian