Guizhen Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Guizhen Liu has a total of 61 co-authors. Here are the top co-authors by number of shared publications:
- Xin Zhang
Department of Finance and Risk Engineering, New York University, New York, NY 11201 USA
15 shared publications - Jian-Liang Wu
School of Mathematics, Shandong University, Jinan, China
11 shared publications - Qinglin Yu
School of Science Xi'an Polytechnic University Xi'an China
9 shared publications - JianFeng Hou
Fuzhou University
8 shared publications - Bin Liu
Shandong University
6 shared publications Jianfeng Hou
Center for Discrete Mathematics, Fuzhou University, Fujian 350002, PR China
6 shared publications
Latest Publications
- 15 October 2013
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 29 (11) , 2079-2086
Group edge choosability of planar graphs without adjacent short cycles
- 15 October 2013
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 29 (11) , 2079-2086
Group edge choosability of planar graphs without adjacent short cycles
- 19 June 2013
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 30 (1) , 160-173
On total colorings of 1-planar graphs
- 19 June 2013
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 30 (1) , 160-173
On total colorings of 1-planar graphs
- Open Access
On total colorings of 1-planar graphs
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we confirm the total-coloring conjecture for 1-planar graphs with maximum degree at least 13.
Open AccessOn total colorings of 1-planar graphs
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we confirm the total-coloring conjecture for 1-planar graphs with maximum degree at least 13.
- 22 March 2013
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 30 (2) , 343-352
Every toroidal graph is acyclically 8-choosable
- 22 March 2013
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 30 (2) , 343-352
Every toroidal graph is acyclically 8-choosable
- 4 March 2013
- Published by Springer Nature in Frontiers of Mathematics in China
- Vol. 8 (4) , 801-809
Properties of Hamilton cycles of circuit graphs of matroids
- 4 March 2013
- Published by Springer Nature in Frontiers of Mathematics in China
- Vol. 8 (4) , 801-809
Properties of Hamilton cycles of circuit graphs of matroids
- 14 January 2013
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 29 (7) , 1421-1428
On edge colorings of 1-toroidal graphs
- 14 January 2013
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 29 (7) , 1421-1428
On edge colorings of 1-toroidal graphs
- Open Access
- 21 November 2012
- Published by Walter de Gruyter GmbH in Open Mathematics
- Vol. 11 (2) , 308-321
The structure of plane graphs with independent crossings and its applications to coloring problems
If a graph G has a drawing in the plane in such a way that every two crossings are independent, then we call G a plane graph with independent crossings or IC-planar graph for short. In this paper, the structure of IC-planar graphs with minimum degree at least two or three is studied. By applying their structural results, we prove that the edge chromatic number of G is Δ if Δ ≥ 8, the list edge (resp. list total) chromatic number of G is Δ (resp. Δ + 1) if Δ ≥ 14 and the linear arboricity of G is ℈Δ/2⌊ if Δ ≥ 17, where G is an IC-planar graph and Δ is the maximum degree of G.
- 21 November 2012
- Published by Walter de Gruyter GmbH in Open Mathematics
- Vol. 11 (2) , 308-321
Open AccessThe structure of plane graphs with independent crossings and its applications to coloring problems
If a graph G has a drawing in the plane in such a way that every two crossings are independent, then we call G a plane graph with independent crossings or IC-planar graph for short. In this paper, the structure of IC-planar graphs with minimum degree at least two or three is studied. By applying their structural results, we prove that the edge chromatic number of G is Δ if Δ ≥ 8, the list edge (resp. list total) chromatic number of G is Δ (resp. Δ + 1) if Δ ≥ 14 and the linear arboricity of G is ℈Δ/2⌊ if Δ ≥ 17, where G is an IC-planar graph and Δ is the maximum degree of G.
- 28 October 2012
- Published by Springer Nature in Frontiers of Mathematics in China
- Vol. 8 (1) , 217-227
Nowhere-zero 3-flows in matroid base graph
- 28 October 2012
- Published by Springer Nature in Frontiers of Mathematics in China
- Vol. 8 (1) , 217-227
Nowhere-zero 3-flows in matroid base graph
- 6 March 2012
- Published by Elsevier in Discrete Mathematics
- Vol. 312 (5) , 999-1005
k-forested choosability of planar graphs and sparse graphs
- 6 March 2012
- Published by Elsevier in Discrete Mathematics
- Vol. 312 (5) , 999-1005
k-forested choosability of planar graphs and sparse graphs
- 17 February 2012
- Published by Springer Nature in Frontiers of Mathematics in China
- Vol. 7 (5) , 1005-1018
List edge and list total coloring of 1-planar graphs
- 17 February 2012
- Published by Springer Nature in Frontiers of Mathematics in China
- Vol. 7 (5) , 1005-1018
List edge and list total coloring of 1-planar graphs