Xin Zhang

Orcid: 0000-0001-5250-1657

Affiliations:
  • Xidian University, Department of Mathematics, Xi'an, China
  • Shandong University, School of Mathematics, Jinan, China (2009 - 2012)


According to our database1, Xin Zhang authored at least 62 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Improper odd coloring of IC-planar graphs.
Discret. Appl. Math., 2024

2023
Defective incidence coloring of graphs.
Appl. Math. Comput., 2023

2022
Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy.
Theor. Comput. Sci., 2022

An Improvement of the Bound on the Odd Chromatic Number of 1-Planar Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2022

2021
Theoretical aspects of equitable partition of networks into sparse modules.
Theor. Comput. Sci., 2021

Hardness and algorithms of equitable tree-coloring problem in chordal graphs.
Theor. Comput. Sci., 2021

Equitable list tree-coloring of bounded treewidth graphs.
Theor. Comput. Sci., 2021

<i>h</i>-extra <i>r</i>-component connectivity of interconnection networks with application to hypercubes.
Theor. Comput. Sci., 2021

Incidence coloring of Mycielskians with fast algorithm.
Theor. Comput. Sci., 2021

The structure and the list 3-dynamic coloring of outer-1-planar graphs.
Discret. Math. Theor. Comput. Sci., 2021

On <i>(p, 1)</i>-total labelling of some 1-planar graphs.
Discuss. Math. Graph Theory, 2021

Dynamic list coloring of 1-planar graphs.
Discret. Math., 2021

Equitable partition of planar graphs.
Discret. Math., 2021

2020
Equitable partition of graphs into induced linear forests.
J. Comb. Optim., 2020

Tree-coloring problems of bounded treewidth graphs.
J. Comb. Optim., 2020

Equitable partition of plane graphs with independent crossings into induced forests.
Discret. Math., 2020

Light edges in 1-planar graphs of minimum degree 3.
Discret. Math., 2020

Complexity of Tree-Coloring Interval Graphs Equitably.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

Total Coloring of Outer-1-planar Graphs: The Cold Case.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019
A Structure of 1-Planar Graph and Its Applications to Coloring Problems.
Graphs Comb., 2019

Equitable tree-$O(d)$-coloring of $d$-degenerate graphs.
CoRR, 2019

Equitable vertex arboricity of $d$-degenerate graphs.
CoRR, 2019

Upper bound on the sum of powers of the degrees of graphs with few crossings per edge.
Appl. Math. Comput., 2019

2018
Light paths and edges in families of outer-1-planar graphs.
Inf. Process. Lett., 2018

Equitable coloring and equitable choosability of graphs with small maximum average degree.
Discuss. Math. Graph Theory, 2018

A note on the edge partition of graphs containing either a light edge or an alternating 2-cycle.
CoRR, 2018

2017
Total coloring of outer-1-planar graphs with near-independent crossings.
J. Comb. Optim., 2017

Total coloring of planar graphs without adjacent short cycles.
J. Comb. Optim., 2017

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

2016
A note on the minimum number of choosability of planar graphs.
J. Comb. Optim., 2016

List edge and list total coloring of planar graphs with maximum degree 8.
J. Comb. Optim., 2016

The edge chromatic number of outer-1-planar graphs.
Discret. Math., 2016

Equitable vertex arboricity of subcubic graphs.
Discret. Math., 2016

2015
On total colorings of 1-planar graphs.
J. Comb. Optim., 2015

The r-acyclic chromatic number of planar graphs.
J. Comb. Optim., 2015

Equitable colorings of Cartesian products with balanced complete multipartite graphs.
Discret. Appl. Math., 2015

2014
On r-equitable chromatic threshold of Kronecker products of complete graphs.
Discret. Appl. Math., 2014

On the lightness of chordal 4-cycle in 1-planar graphs with high minimum degree.
Ars Math. Contemp., 2014

2013
List total coloring of pseudo-outerplanar graphs.
Discret. Math., 2013

Equitable vertex arboricity of graphs.
Discret. Math., 2013

2012
On edge colorings of 1-planar graphs without adjacent triangles.
Inf. Process. Lett., 2012

Edge covering pseudo-outerplanar graphs with forests.
Discret. Math., 2012

1-s2.0-S0012365X11004973-si1-forested choosability of planar graphs and sparse graphs.
Discret. Math., 2012

On r-acyclic edge colorings of planar graphs.
Discret. Appl. Math., 2012

A conjecture on equitable vertex arboricity of graphs
CoRR, 2012

Equitable vertex arboricity of graphs
CoRR, 2012

On edge colorings of 1-planar graphs without chordal 5-cycles.
Ars Comb., 2012

Equitable Coloring and Equitable Choosability of Planar Graphs without 6- and 7-Cycles.
Ars Comb., 2012

2011
On edge colorings of 1-planar graphs.
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.
Discret. Math. Theor. Comput. Sci., 2011

On equitable and equitable list colorings of series-parallel graphs.
Discret. Math., 2011

Total coloring of pseudo-outerplanar graphs
CoRR, 2011

(1,λ)-embedded graphs and the acyclic edge choosability
CoRR, 2011

(2,1)-Total labeling of planar graphs with large maximum degree
CoRR, 2011

List (d,1)-total labelling of graphs embedded in surfaces
CoRR, 2011

Group edge choosability of planar graphs without adjacent short cycles
CoRR, 2011

k-forested choosability of graphs with bounded maximum average degree
CoRR, 2011

2010
Vertex-disjoint triangles in K<sub>1, t</sub>-free graphs with minimum degree at least t.
Discret. Math., 2010

Edge Coloring of Triangle-Free 1-Planar Graphs
CoRR, 2010

Degree conditions for the partition of a graph into triangles and quadrilaterals
CoRR, 2010

Structural properties of 1-planar graphs and an application to acyclic edge coloring
CoRR, 2010


  Loading...