Guizhen Liu

According to our database1, Guizhen Liu authored at least 114 papers between 1988 and 2017.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Graphs of f-class 1.
Discrete Applied Mathematics, 2017

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

2014
Total coloring of embedded graphs with maximum degree at least seven.
Theor. Comput. Sci., 2014

Fractional f-Edge Cover Chromatic Index of Graphs.
Graphs and Combinatorics, 2014

Long properly colored cycles in edge colored complete graphs.
Discrete Mathematics, 2014

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

The E2-Hamiltonian Property of Circuit Graphs of Matroids.
Ars Comb., 2014

2013
List Edge and List Total Colorings of Planar Graphs without non-induced 7-cycles.
Discrete Mathematics & Theoretical Computer Science, 2013

A note on Rainbow Matchings.
Discrete Math., Alg. and Appl., 2013

On total colorings of 1-planar graphs
CoRR, 2013

Long properly colored cycles in edge-colored complete graphs
CoRR, 2013

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

A Note on Heterochromatic C 4 in Edge-Colored Triangle-Free Graphs.
Graphs and Combinatorics, 2012

Circular Coloring of Planar Digraphs.
Graphs and Combinatorics, 2012

Acyclic Edge Coloring of Planar Graphs Without Small Cycles.
Graphs and Combinatorics, 2012

A Bound on the bondage Number of toroidal Graphs.
Discrete Math., Alg. and Appl., 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

On r-acyclic edge colorings of planar graphs.
Discrete Applied Mathematics, 2012

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

Toughness and [a, b]-factors in graphs.
Ars Comb., 2012

2011
Equitable edge-colorings of simple graphs.
Journal of Graph Theory, 2011

On edge covering colorings of 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.
Discrete Mathematics & Theoretical Computer Science, 2011

Circular vertex arboricity.
Discrete Applied Mathematics, 2011

Improved bounds for acyclic chromatic index of planar graphs.
Discrete Applied Mathematics, 2011

Total coloring of planar graphs without 6-cycles.
Discrete Applied Mathematics, 2011

Total coloring of pseudo-outerplanar graphs
CoRR, 2011

Edge covering pseudo-outerplanar graphs with forests
CoRR, 2011

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

List version of ($p$,1)-total labellings
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

Circular choosability of planar graphs with large girth.
Ars Comb., 2011

On edge cover coloring of join graphs.
Ars Comb., 2011

Edge-choosability of planar graphs without chordal 7-Cycles.
Ars Comb., 2011

2010
The method of coloring in graphs and its application.
J. Systems Science & Complexity, 2010

Acyclic edge chromatic number of outerplanar graphs.
Journal of Graph Theory, 2010

On the fractional f-chromatic index of a graph.
Int. J. Comput. Math., 2010

On the adjacent vertex distinguishing edge colourings of graphs.
Int. J. Comput. Math., 2010

Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles.
Int. J. Comput. Math., 2010

Vertex-Distinguishing Edge Colorings of Graphs with Degree Sum Conditions.
Graphs and Combinatorics, 2010

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

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

On fractional (g, f, n)-critical graphs.
Ars Comb., 2010

A New Result on [k, k + 1]-Factors Containing Given Hamiltonian Cycles.
Proceedings of the Combinatorial Optimization and Applications, 2010

2009
Acyclic edge coloring of planar graphs with large girth.
Theor. Comput. Sci., 2009

Paths, cycles and circular colorings in digraphs.
Theor. Comput. Sci., 2009

A note on "The super connectivity of augmented cubes".
Inf. Process. Lett., 2009

Edge-choosability of planar graphs without non-induced 5-cycles.
Inf. Process. Lett., 2009

On Super F-Edge Cover-Coloring in multigraphs.
Discrete Math., Alg. and Appl., 2009

On 2-factors with cycles containing specified edges in a bipartite graph.
Discrete Mathematics, 2009

Total colorings and list total colorings of planar graphs without intersecting 4-cycles.
Discrete Mathematics, 2009

Edge-choosability of planar graphs without adjacent triangles or without 7-cycles.
Discrete Mathematics, 2009

A Neighborhood Condition for Graphs to Have (g, f)-Factors.
Ars Comb., 2009

The heterochromatic matchings in edge-colored bipartite graphs.
Ars Comb., 2009

On 3-Degeneracy of Some C7-free Plane Graphs with Application to Choosability.
Ars Comb., 2009

The stability number and connected [k, k+1]-factor in graphs.
Appl. Math. Lett., 2009

2008
Fault-tolerant embedding of paths in crossed cubes.
Theor. Comput. Sci., 2008

Paths in circuit graphs of matroids.
Theor. Comput. Sci., 2008

The super connectivity of augmented cubes.
Inf. Process. Lett., 2008

List edge and list total colorings of planar graphs without short cycles.
Inf. Process. Lett., 2008

Bipartite Toughness and k-Factors in Bipartite Graphs.
Int. J. Math. Mathematical Sciences, 2008

Binding number and Hamiltonian (g, f)-factors in graphs II.
Int. J. Comput. Math., 2008

Total Colorings of Planar Graphs without Small Cycles.
Graphs and Combinatorics, 2008

A note on the edge cover chromatic index of multigraphs.
Discrete Mathematics, 2008

Edge covered critical multigraphs.
Discrete Mathematics, 2008

Toughness and the existence of fractional k-factors of graphs.
Discrete Mathematics, 2008

Characterizations of maximum fractional (g, f)-factors of graphs.
Discrete Applied Mathematics, 2008

Hamilton cycles in circuit graphs of matroids.
Computers & Mathematics with Applications, 2008

The Classification of Regular Graphs on f-colorings.
Ars Comb., 2008

Strongly pan-factorial property in cages.
Ars Comb., 2008

Stability Number and f-factor in K1, n-free Graphs.
Ars Comb., 2008

Some graphs of class 1 for f-colorings.
Appl. Math. Lett., 2008

2007
The linear arboricity of planar graphs with no short cycles.
Theor. Comput. Sci., 2007

Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes.
Parallel Computing, 2007

Some results about f-critical graphs.
Networks, 2007

Cycles in Circuit Graphs of Matroids.
Graphs and Combinatorics, 2007

On 2-Factors with Quadrilaterals Containing Specified Vertices in a Bipartite Graph.
Ars Comb., 2007

Some Results on Fractional Edge Coloring of Graphs.
Ars Comb., 2007

Maximum fractional factors in graphs.
Appl. Math. Lett., 2007

Path embedding in faulty hypercubes.
Applied Mathematics and Computation, 2007

Some Results on Fractional Graph Theory.
Proceedings of the Computational Geometry and Graph Theory, 2007

A Note on Factional Extendable Graphs.
Proceedings of the International MultiConference of Engineers and Computer Scientists 2007, 2007

A Class of Graphs of f -Class 1.
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

The Edge Connectivity of Circuit Graphs of Matroids.
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

Binding Number and Connected ( g , f + 1)-Factors in Graphs.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

Notes on Fractional (1, f )-Odd Factors of Graphs.
Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007

2006
List edge and list total colorings of planar graphs without 4-cycles.
Theor. Comput. Sci., 2006

A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2.
Discrete Mathematics, 2006

Stability Number and Fractional F-factors in Graphs.
Ars Comb., 2006

Some sufficient conditions for a graph to be of Cf 1.
Appl. Math. Lett., 2006

2005
Some Topics on Edge-Coloring.
Proceedings of the Discrete Geometry, 2005

2004
Number of maximum matchings of bipartite graphs with positive surplus.
Discrete Mathematics, 2004

f-Factors in bipartite (mf)-graphs.
Discrete Applied Mathematics, 2004

2003
Some Problems on Factorizations with Constraints in Bipartite Graphs.
Discrete Applied Mathematics, 2003

2002
The fractional matching numbers of graphs.
Networks, 2002

Orthogonal factorizations of graphs.
Journal of Graph Theory, 2002

A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling.
Int. J. Found. Comput. Sci., 2002

A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling.
Proceedings of the Integer Programming and Combinatorial Optimization, 2002

2001
Generalization of matching extensions in graphs.
Discrete Mathematics, 2001

2000
Orthogonal (g, f)-factorizations in networks.
Networks, 2000

1998
On endo-homology of complexes of graphs.
Discrete Mathematics, 1998

Toughness and Perfect Matchings in Graphs.
Ars Comb., 1998

1995
Orthogonal (g, f)-factorizations in graphs.
Discrete Mathematics, 1995

1990
A simple existence criterion for (g (DOI)
Discrete Mathematics, 1990

1989
Paths and cycles in matroid base graphs.
Graphs and Combinatorics, 1989

1988
On connectivities of tree graphs.
Journal of Graph Theory, 1988

A lower bound on the number of spanning trees with k end-vertices.
Journal of Graph Theory, 1988

A lower bound on connectivities of matroid base graphs.
Discrete Mathematics, 1988


  Loading...