# Jian-Liang Wu

According to our database

Collaborative distances:

^{1}, Jian-Liang Wu authored at least 108 papers between 1999 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

On edge colorings of 1-planar graphs without 5-cycles with two chords.

Discussiones Mathematicae Graph Theory, 2019

Graphs are (1, Δ+1)-choosable.

Discrete Mathematics, 2019

2018

Edge coloring of planar graphs without adjacent 7-cycles.

Theor. Comput. Sci., 2018

List-edge-coloring of planar graphs without 6-cycles with three chords.

J. Comb. Optim., 2018

Minimum choosability of planar graphs.

J. Comb. Optim., 2018

Generalized acyclic edge colorings via entropy compression.

J. Comb. Optim., 2018

The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven.

J. Comb. Optim., 2018

Vertex arboricity of planar graphs without intersecting 5-cycles.

J. Comb. Optim., 2018

DPRank centrality: Finding important vertices based on random walks with a new defined transition matrix.

Future Generation Comp. Syst., 2018

Multipolarization versus unification in community networks.

Future Generation Comp. Syst., 2018

On splitting digraphs.

Eur. J. Comb., 2018

Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles.

Discussiones Mathematicae Graph Theory, 2018

List r-hued chromatic number of graphs with bounded maximum average degrees.

Discrete Mathematics, 2018

Planar graphs without chordal 6-cycles are 4-choosable.

Discrete Applied Mathematics, 2018

A note on the edge colorings of planar graphs without 7-cycles with three chords.

Ars Comb., 2018

On the first reformulated Zagreb indices of graphs with a given clique number.

Ars Comb., 2018

Equitable and List Equitable Colorings of Planar Graphs without 6-Cycles.

Ars Comb., 2018

Local antimagic labeling of graphs.

Applied Mathematics and Computation, 2018

A lower bound of revised Szeged index of bicyclic graphs.

Applied Mathematics and Computation, 2018

2017

On (p, 1)-total labelling of planar graphs.

J. Comb. Optim., 2017

The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles.

J. Comb. Optim., 2017

The adjacent vertex distinguishing total chromatic numbers of planar graphs Δ = 10.

J. Comb. Optim., 2017

Equitable vertex arboricity of 5-degenerate graphs.

J. Comb. Optim., 2017

On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs.

Graphs and Combinatorics, 2017

Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz.

Graphs and Combinatorics, 2017

Planar graphs without intersecting 5-cycles are 4-choosable.

Discrete Mathematics, 2017

A sufficient condition for a planar graph to be 4-choosable.

Discrete Applied Mathematics, 2017

Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10.

Applied Mathematics and Computation, 2017

2016

On the neighbor sum distinguishing total coloring of planar graphs.

Theor. Comput. Sci., 2016

Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic.

J. Comb. Optim., 2016

Total coloring of planar graphs without short cycles.

J. Comb. Optim., 2016

A Relaxed Case on 1-2-3 Conjecture.

Graphs and Combinatorics, 2016

List injective coloring of planar graphs with girth g≥6.

Discrete Mathematics, 2016

On r-hued coloring of planar graphs with girth at least 6.

Discrete Applied Mathematics, 2016

Entire Chromatic Number of 1-Tree.

Ars Comb., 2016

2015

Some sufficient conditions for 1-planar graphs to be Class 1.

Theor. Comput. Sci., 2015

PaddyFrog: systematically detecting confused deputy vulnerability in Android applications.

Security and Communication Networks, 2015

Total Coloring of Planar Graphs Without Chordal Short Cycles.

Graphs and Combinatorics, 2015

Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ.

Discrete Applied Mathematics, 2015

Acyclic Total Colorings of Planar Graphs.

Ars Comb., 2015

All Your Sessions Are Belong to Us: Investigating Authenticator Leakage through Backup Channels on Android.

Proceedings of the 20th International Conference on Engineering of Complex Computer Systems, 2015

Automatically Detecting SSL Error-Handling Vulnerabilities in Hybrid Mobile Web Apps.

Proceedings of the 10th ACM Symposium on Information, 2015

2014

Total coloring of planar graphs with 7-cycles containing at most two chords.

Theor. Comput. Sci., 2014

Edge colorings of planar graphs without 5-cycles with two chords.

Theor. Comput. Sci., 2014

Total coloring of planar graphs with maximum degree 8.

Theor. Comput. Sci., 2014

Total coloring of embedded graphs with maximum degree at least seven.

Theor. Comput. Sci., 2014

Edge coloring of planar graphs which any two short cycles are adjacent at most once.

Theor. Comput. Sci., 2014

Total colorings of planar graphs with sparse triangles.

Theor. Comput. Sci., 2014

Quantity strategies in economic networks.

Oper. Res. Lett., 2014

Minimum total coloring of planar graph.

J. Global Optimization, 2014

Minimum number of disjoint linear forests covering a planar graph.

J. Comb. Optim., 2014

Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle.

J. Comb. Optim., 2014

Zagreb Eccentricity Indices of the Generalized Hierarchical Product Graphs and Their Applications.

J. Applied Mathematics, 2014

On the linear arboricity of graphs embeddable in surfaces.

Inf. Process. Lett., 2014

A note on Edge Weight choosability of graphs.

Discrete Math., Alg. and Appl., 2014

Total colorings of planar graphs without chordal 6-cycles.

Discrete Applied Mathematics, 2014

Total Colorings of $F_5$-free Planar Graphs with Maximum Degree 8.

Electr. J. Comb., 2014

TrustFound: Towards a Formal Foundation for Model Checking Trusted Computing Platforms.

Proceedings of the FM 2014: Formal Methods, 2014

2013

Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords.

Theor. Comput. Sci., 2013

Erratum to "Acyclic Edge Chromatic Number of Outerplanar Graphs".

Journal of Graph Theory, 2013

The Linear Arboricity of Planar Graphs without 5-, 6-Cycles with Chords.

Graphs and Combinatorics, 2013

Equitable vertex arboricity of graphs.

Discrete Mathematics, 2013

The Vertex Linear Arboricity of a Special Class of Integer Distance Graphs.

Ars Comb., 2013

2012

A Planar linear arboricity conjecture.

Journal of Graph Theory, 2012

Acyclic Edge Coloring of Planar Graphs Without Small Cycles.

Graphs and Combinatorics, 2012

Edge covering pseudo-outerplanar graphs with forests.

Discrete Mathematics, 2012

1-s2.0-S0012365X11004973-si1-forested choosability of planar graphs and sparse graphs.

Discrete Mathematics, 2012

A note on the total coloring of planar graphs without adjacent 4-cycles.

Discrete Mathematics, 2012

Total colorings of planar graphs without intersecting 5-cycles.

Discrete Applied Mathematics, 2012

2011

On edge colorings of 1-planar graphs.

Inf. Process. Lett., 2011

Total coloring of planar graphs with maximum degree 7.

Inf. Process. Lett., 2011

Acyclic chromatic index of planar graphs with triangles.

Inf. Process. Lett., 2011

A note on relaxed equitable coloring of graphs.

Inf. Process. Lett., 2011

New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree.

Discrete Mathematics & Theoretical Computer Science, 2011

On equitable and equitable list colorings of series-parallel graphs.

Discrete Mathematics, 2011

Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles.

Discrete Mathematics, 2011

Circular vertex arboricity.

Discrete Applied Mathematics, 2011

Total coloring of planar graphs without 6-cycles.

Discrete Applied Mathematics, 2011

Edge colorings of planar graphs with maximum degree five.

Ars Comb., 2011

2010

Acyclic edge chromatic number of outerplanar graphs.

Journal of Graph Theory, 2010

Vertex-disjoint triangles in K

_{1, t}-free graphs with minimum degree at least t.
Discrete Mathematics, 2010

2009

Vertex arboricity of integer distance graph G(D

_{m, k}).
Discrete Mathematics, 2009

Total colorings of planar graphs without adjacent triangles.

Discrete Mathematics, 2009

Planar graphs without 5-cycles or without 6-cycles.

Discrete Mathematics, 2009

Total colorings and list total colorings of planar graphs without intersecting 4-cycles.

Discrete Mathematics, 2009

On 3-Degeneracy of Some C7-free Plane Graphs with Application to Choosability.

Ars Comb., 2009

2008

The Linear Arboricity of Graphs on Surfaces of Negative Euler Characteristic.

SIAM J. Discrete Math., 2008

The linear arboricity of planar graphs of maximum degree seven is four.

Journal of Graph Theory, 2008

Total Colorings of Planar Graphs without Small Cycles.

Graphs and Combinatorics, 2008

List-edge and list-total colorings of graphs embedded on hyperbolic surfaces.

Discrete Mathematics, 2008

Equitable coloring planar graphs with large girth.

Discrete Mathematics, 2008

The Vertex Linear Arboricity of Claw-Free Graphs with Small Degree.

Ars Comb., 2008

2007

The linear arboricity of planar graphs with no short cycles.

Theor. Comput. Sci., 2007

A Linear Algorithm for Edge-Face Coloring Series-Parallel Graphs.

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

The Equitable Edge-Coloring of Series-Parallel Graphs.

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

Some Results on List Total Colorings of Planar Graphs.

Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

2006

The vertex linear arboricity of distance graphs.

Discrete Mathematics, 2006

The Fractional Vertex Linear Arboricity of Graphs.

Ars Comb., 2006

The Vertex Linear Arboricity of an Integer Distance Graph with a Special Distance Set.

Ars Comb., 2006

Tree coloring of distance graphs with a real interval set.

Appl. Math. Lett., 2006

2005

Two sufficient conditions for a graph to be type 1.

Ars Comb., 2005

2004

A note on total colorings of planar graphs without 4-cycles.

Discussiones Mathematicae Graph Theory, 2004

Minimum average distance of strong orientations of graphs.

Discrete Applied Mathematics, 2004

Total Coloring of Series-Parallel Graphs.

Ars Comb., 2004

2003

An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree.

Discrete Mathematics, 2003

2002

Edge-coloring critical graphs with high degree.

Discrete Mathematics, 2002

2000

The Linear Arboricity of Series-Parallel Graphs.

Graphs and Combinatorics, 2000

1999

On the linear arboricity of planar graphs.

Journal of Graph Theory, 1999