Person:592984: Difference between revisions

From MaRDI portal
Person:592984
Created automatically from import231006081045
 
m AuthorDisambiguator moved page Jian Liang Wu to Jian Liang Wu: Duplicate
 
(No difference)

Latest revision as of 13:23, 10 December 2023

Available identifiers

zbMath Open wu.jian-liangMaRDI QIDQ592984

List of research outcomes





PublicationDate of PublicationType
On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs2024-03-20Paper
4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz2023-02-21Paper
$4$-choosability of planar graphs with $4$-cycles far apart via the Combinatorial Nullstellensatz2022-11-07Paper
The linear arboricity of \(K_5\)-minor free graphs2022-10-13Paper
A note on the edge choosability of $K_{5}$-minor free graphs2022-08-23Paper
On generalized neighbor sum distinguishing index of planar graphs2022-06-21Paper
Information spreading with relative attributes on signed networks2022-04-14Paper
The total coloring of \(K_5\)-minor-free graphs2022-04-07Paper
https://portal.mardi4nfdi.de/entity/Q50626002022-03-17Paper
1-平面图的结构性质及其在无圈边染色上的应用2021-12-17Paper
https://portal.mardi4nfdi.de/entity/Q33821992021-09-20Paper
https://portal.mardi4nfdi.de/entity/Q33822322021-09-20Paper
The edge colorings of \(K_5\)-minor free graphs2021-04-28Paper
List edge coloring of planar graphs without 6-cycles with two chords2020-12-08Paper
Multiplicative Zagreb eccentricity indices of some composite graphs2020-11-24Paper
https://portal.mardi4nfdi.de/entity/Q51276482020-10-27Paper
The list edge coloring and list total coloring of planar graphs with maximum degree at least 72020-08-26Paper
Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs2020-05-21Paper
Transcendental behavior and disturbance behavior favor human development2020-05-07Paper
The edge colorings of $K_{5}$-minor free graphs2020-02-24Paper
List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly2020-02-20Paper
Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles2020-01-15Paper
https://portal.mardi4nfdi.de/entity/Q52063292019-12-18Paper
https://portal.mardi4nfdi.de/entity/Q52063852019-12-18Paper
On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\)2019-06-27Paper
Local antimagic labeling of graphs2019-06-21Paper
A lower bound of revised Szeged index of bicyclic graphs2019-04-30Paper
Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 102019-04-29Paper
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 92019-03-25Paper
On edge colorings of 1-planar graphs without 5-cycles with two chords2019-02-07Paper
Zagreb eccentricity indices of the generalized hierarchical product graphs and their applications2019-02-01Paper
Graphs are \((1, \varDelta + 1)\)-choosable2018-11-13Paper
https://portal.mardi4nfdi.de/entity/Q46845182018-10-01Paper
Quantity strategies in economic networks2018-09-28Paper
SICR rumor spreading model in complex networks: counterattack and self-resistance2018-09-20Paper
https://portal.mardi4nfdi.de/entity/Q46833402018-09-20Paper
The information transmission in community networks2018-09-11Paper
Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles2018-08-10Paper
Minimum choosability of planar graphs2018-07-26Paper
Edge coloring of planar graphs without adjacent 7-cycles2018-06-18Paper
Planar graphs without chordal 6-cycles are 4-choosable2018-05-24Paper
On splitting digraphs2018-05-18Paper
Edge colorings of planar graphs without 6-cycles with three chords2018-04-25Paper
Generalized acyclic edge colorings via entropy compression2018-04-13Paper
List \(r\)-hued chromatic number of graphs with bounded maximum average degrees2018-04-05Paper
Vertex arboricity of planar graphs without intersecting 5-cycles2018-03-01Paper
List-edge-coloring of planar graphs without 6-cycles with three chords2018-03-01Paper
The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven2018-02-21Paper
The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)2017-10-17Paper
Equitable vertex arboricity of 5-degenerate graphs2017-10-17Paper
Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz2017-10-11Paper
On the equitable edge-coloring of 1-planar graphs and planar graphs2017-10-11Paper
On total colorings of some special 1-planar graphs2017-09-05Paper
The Wiener index of \(r\)-uniform hypergraphs2017-08-24Paper
The linear arboricity of planar graphs without 5-cycles with two chords2017-07-19Paper
A deep stochastic model for detecting community in complex networks2017-06-08Paper
Planar graphs without intersecting 5-cycles are 4-choosable2017-05-22Paper
A sufficient condition for a planar graph to be 4-choosable2017-05-15Paper
Neighbor sum distinguishing edge coloring of subcubic graphs2017-04-21Paper
A conjecture on equitable vertex arboricity of graphs2017-04-11Paper
A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five2017-04-03Paper
On \((p,1)\)-total labelling of planar graphs2017-03-03Paper
The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles2017-02-22Paper
https://portal.mardi4nfdi.de/entity/Q28288722016-10-26Paper
https://portal.mardi4nfdi.de/entity/Q28289512016-10-26Paper
List injective coloring of planar graphs with girth \(g \geq 6\)2016-08-16Paper
A relaxed case on 1-2-3 conjecture2016-07-28Paper
Neighbor sum distinguishing edge colorings of graphs with small maximum average degree2016-07-11Paper
Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic2016-05-11Paper
Total coloring of planar graphs without short cycles2016-05-11Paper
On the neighbor sum distinguishing total coloring of planar graphs2015-12-08Paper
On \(r\)-hued coloring of planar graphs with girth at least 62015-12-07Paper
https://portal.mardi4nfdi.de/entity/Q34539722015-12-02Paper
Total coloring of planar graphs without chordal short cycles2015-09-24Paper
Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)2015-07-06Paper
Total coloring of planar graphs without some chordal 6-cycles2015-04-21Paper
Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle2015-01-21Paper
Some sufficient conditions for 1-planar graphs to be class 12015-01-06Paper
Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic2014-12-02Paper
Acyclic total colorings of planar graphs without \(l\) cycles2014-11-27Paper
Minimum total coloring of planar graph2014-11-27Paper
https://portal.mardi4nfdi.de/entity/Q29315042014-11-25Paper
Minimum number of disjoint linear forests covering a planar graph2014-09-05Paper
Total colorings of \(F_5\)-free planar graphs with maximum degree 82014-09-04Paper
The influence of human heterogeneity to information spreading2014-07-10Paper
Total colorings of planar graphs without chordal 6-cycles2014-05-06Paper
On the linear arboricity of graphs embeddable in surfaces2014-05-05Paper
A NOTE ON EDGE WEIGHT CHOOSABILITY OF GRAPHS2014-04-25Paper
https://portal.mardi4nfdi.de/entity/Q54082912014-04-09Paper
https://portal.mardi4nfdi.de/entity/Q54030012014-03-25Paper
A note on list edge and list total coloring of planar graphs without adjacent short cycles2014-03-18Paper
Total colorings of planar graphs with sparse triangles2014-03-13Paper
Total coloring of planar graphs with maximum degree 82014-01-24Paper
Equitable vertex arboricity of graphs2014-01-24Paper
ON THE SUM OF POWERS OF THE DEGREES OF GRAPHS2014-01-14Paper
Total coloring of planar graphs with 7-cycles containing at most two chords2014-01-13Paper
Total coloring of embedded graphs with maximum degree at least seven2014-01-13Paper
Edge colorings of planar graphs without 5-cycles with two chords2014-01-13Paper
Edge coloring of planar graphs which any two short cycles are adjacent at most once2013-12-13Paper
https://portal.mardi4nfdi.de/entity/Q28584442013-11-19Paper
https://portal.mardi4nfdi.de/entity/Q28608042013-11-11Paper
https://portal.mardi4nfdi.de/entity/Q28608182013-11-11Paper
Total colorings of planar graphs with small maximum degree2013-08-28Paper
The linear arboricity of planar graphs without 5-, 6-cycles with chords2013-06-26Paper
The linear arboricity of planar graphs without 5-cycles with chords2013-06-26Paper
https://portal.mardi4nfdi.de/entity/Q49268032013-06-20Paper
\(k\)-forested choosability of graphs with bounded maximum average degree2013-06-12Paper
Erratum to “Acyclic Edge Chromatic Number of Outerplanar Graphs”2013-04-19Paper
Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords2013-04-17Paper
On edge colorings of \(1\)-planar graphs2013-04-04Paper
Acyclic chromatic index of planar graphs with triangles2013-04-04Paper
Total coloring of planar graphs with maximum degree \(7\)2013-04-04Paper
A note on relaxed equitable coloring of graphs2013-04-04Paper
Acyclic edge coloring of planar graphs without small cycles2012-12-27Paper
List edge and list total coloring of 1-planar graphs2012-12-06Paper
Light subgraphs in the family of 1-planar graphs with high minimum degree2012-11-07Paper
Edge covering pseudo-outerplanar graphs with forests2012-09-12Paper
Total colorings of planar graphs without intersecting 5-cycles2012-08-14Paper
Degree conditions for the partition of a graph into triangles and quadrilaterals2012-07-02Paper
https://portal.mardi4nfdi.de/entity/Q28954182012-07-02Paper
A note on the total coloring of planar graphs without adjacent 4-cycles2012-06-18Paper
A Planar linear arboricity conjecture2012-06-13Paper
(1,λ)-EMBEDDED GRAPHS AND THE ACYCLIC EDGE CHOOSABILITY2012-06-08Paper
https://portal.mardi4nfdi.de/entity/Q28871452012-06-01Paper
https://portal.mardi4nfdi.de/entity/Q28812562012-04-03Paper
\(k\)-forested choosability of planar graphs and sparse graphs2012-03-16Paper
THE LINEAR 2-ARBORICITY OF PLANAR GRAPHS WITHOUT ADJACENT SHORT CYCLES2012-03-13Paper
https://portal.mardi4nfdi.de/entity/Q31150722012-02-20Paper
The linear arboricity of planar graphs with maximum degree at least five2011-11-22Paper
Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles2011-10-21Paper
https://portal.mardi4nfdi.de/entity/Q51998422011-08-16Paper
Circular vertex arboricity2011-08-10Paper
https://portal.mardi4nfdi.de/entity/Q30171672011-07-19Paper
Edge Coloring of Triangle-Free 1-Planar Graphs2011-07-19Paper
https://portal.mardi4nfdi.de/entity/Q30117252011-06-29Paper
On equitable and equitable list colorings of series-parallel graphs2011-05-10Paper
\(k\)-forested coloring of planar graphs with large girth2011-03-29Paper
Total coloring of embedded graphs of maximum degree at least ten2011-02-25Paper
https://portal.mardi4nfdi.de/entity/Q30702562011-02-02Paper
Total coloring of planar graphs without 6-cycles2011-01-21Paper
Acyclic edge chromatic number of outerplanar graphs2010-11-10Paper
Vertex-disjoint triangles in \(K_{1,t}\)-free graphs with minimum degree at least \(t\)2010-10-11Paper
A Planar linear arboricity conjecture2010-05-28Paper
The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic2010-03-17Paper
Total colorings and list total colorings of planar graphs without intersecting 4-cycles2009-12-15Paper
Acyclic edge colorings of planar graphs and series parallel graphs2009-12-07Paper
https://portal.mardi4nfdi.de/entity/Q53192582009-07-22Paper
https://portal.mardi4nfdi.de/entity/Q53204682009-07-22Paper
Planar graphs without 5-cycles or without 6-cycles2009-06-23Paper
Vertex arboricity of integer distance graph \(G(D_{m,k})\)2009-06-17Paper
https://portal.mardi4nfdi.de/entity/Q36108422009-03-06Paper
List-edge and list-total colorings of graphs embedded on hyperbolic surfaces2009-01-28Paper
Total colorings of planar graphs without adjacent triangles2009-01-28Paper
The linear arboricity of planar graphs of maximum degree seven is four2008-09-04Paper
Total colorings of planar graphs without small cycles2008-08-20Paper
Tree coloring of distance graphs with a real interval set2008-04-10Paper
https://portal.mardi4nfdi.de/entity/Q54530432008-04-04Paper
Equitable coloring planar graphs with large girth2008-02-14Paper
https://portal.mardi4nfdi.de/entity/Q54273152007-11-20Paper
https://portal.mardi4nfdi.de/entity/Q53102162007-09-21Paper
The linear arboricity of planar graphs with no short cycles2007-09-03Paper
https://portal.mardi4nfdi.de/entity/Q34286342007-03-29Paper
https://portal.mardi4nfdi.de/entity/Q54925712006-10-16Paper
The vertex linear arboricity of distance graphs2006-03-29Paper
The entire coloring of series-parallel graphs2006-01-05Paper
https://portal.mardi4nfdi.de/entity/Q54635282005-08-04Paper
Minimum average distance of strong orientations of graphs2004-11-23Paper
A note on total colorings of planar graphs without 4-cycles2004-10-27Paper
An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree2003-09-25Paper
The linear arboricity of composition graphs2003-04-09Paper
https://portal.mardi4nfdi.de/entity/Q44393842003-01-01Paper
Edge-coloring critical graphs with high degree2002-12-02Paper
https://portal.mardi4nfdi.de/entity/Q49498812001-08-02Paper
https://portal.mardi4nfdi.de/entity/Q27213392001-07-02Paper
https://portal.mardi4nfdi.de/entity/Q27124812001-05-06Paper
https://portal.mardi4nfdi.de/entity/Q27044462001-03-19Paper
The linear arboricity of series-parallel graphs2000-11-14Paper
https://portal.mardi4nfdi.de/entity/Q42673172000-04-10Paper
https://portal.mardi4nfdi.de/entity/Q42485361999-09-29Paper
https://portal.mardi4nfdi.de/entity/Q43879031998-05-14Paper

Research outcomes over time

This page was built for person: Jian Liang Wu