Guizhen Liu

According to our database1, Guizhen Liu authored at least 119 papers between 1988 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Atmospheric Methane Retrieval Based on Back Propagation Neural Network and Simulated AVIRIS-NG Data.
IEEE Geosci. Remote. Sens. Lett., 2024

2021
Fusion of GF and MODIS Data for Regional-Scale Grassland Community Classification with EVI2 Time-Series and Phenological Features.
Remote. Sens., 2021

2019
Design and Finite Element Analysis of Anastomosis System for Digestive Tract Surgery.
Proceedings of the 2019 IEEE International Conference on Robotics and Biomimetics, 2019

2018
Stability Analysis of the Key Parts of the Continuous Body of Laryngeal Surgery.
Proceedings of the IEEE International Conference on Information and Automation, 2018

2017
Graphs of f-class 1.
Discret. Appl. Math., 2017

Research on the docking longitudinal replenishment at sea based on ABAQUS and virtual simulation technology.
Proceedings of the IEEE International Conference on Information and Automation, 2017

2016
Design and finite element analysis of 6-RUS parallel connection mechanism.
Proceedings of the IEEE International Conference on Information and Automation, 2016

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

Kinematics analysis and Simulation of the laryngeal minimally invasive operation continuum mechanism.
Proceedings of the IEEE International Conference on Information and Automation, 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 Comb., 2014

Long properly colored cycles in edge colored complete graphs.
Discret. Math., 2014

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

The E<sub>2</sub>-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.
Discret. Math. Theor. Comput. Sci., 2013

A note on Rainbow Matchings.
Discret. Math. Algorithms Appl., 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 Comb., 2012

Circular Coloring of Planar Digraphs.
Graphs Comb., 2012

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

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

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.
J. 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.
Discret. Math. Theor. Comput. Sci., 2011

Circular vertex arboricity.
Discret. Appl. Math., 2011

Improved bounds for acyclic chromatic index of planar graphs.
Discret. Appl. Math., 2011

Total coloring of planar graphs without 6-cycles.
Discret. Appl. Math., 2011

Total coloring of pseudo-outerplanar graphs
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. Syst. Sci. Complex., 2010

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

On the fractional <i>f</i>-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 Comb., 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 [<i>k</i>, <i>k</i> + 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.
Discret. Math. Algorithms Appl., 2009

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

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

Edge-choosability of planar graphs without adjacent triangles or without 7-cycles.
Discret. Math., 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. Math. Sci., 2008

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

Total Colorings of Planar Graphs without Small Cycles.
Graphs Comb., 2008

A note on the edge cover chromatic index of multigraphs.
Discret. Math., 2008

Edge covered critical multigraphs.
Discret. Math., 2008

Toughness and the existence of fractional k-factors of graphs.
Discret. Math., 2008

Characterizations of maximum fractional (g, f)-factors of graphs.
Discret. Appl. Math., 2008

Hamilton cycles in circuit graphs of matroids.
Comput. Math. Appl., 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 K<sub>1, n</sub>-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 Comput., 2007

Some results about <i>f</i>-critical graphs.
Networks, 2007

Cycles in Circuit Graphs of Matroids.
Graphs Comb., 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.
Appl. Math. Comput., 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 <i>f</i> -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 ( <i>g</i> , <i>f</i> + 1)-Factors in Graphs.
Proceedings of the Computational Science - ICCS 2007, 7th International Conference, Beijing, China, May 27, 2007

Notes on Fractional (1, <i>f</i> )-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.
Discret. Math., 2006

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

Some sufficient conditions for a graph to be of <i>C</i><sub><i>f</i></sub> 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.
Discret. Math., 2004

f-Factors in bipartite (mf)-graphs.
Discret. Appl. Math., 2004

2003
Some Problems on Factorizations with Constraints in Bipartite Graphs.
Discret. Appl. Math., 2003

2002
The fractional matching numbers of graphs.
Networks, 2002

Orthogonal factorizations of graphs.
J. 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.
Discret. Math., 2001

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

1998
On endo-homology of complexes of graphs.
Discret. Math., 1998

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

1995
Orthogonal (g, f)-factorizations in graphs.
Discret. Math., 1995

1990
A simple existence criterion for (g<f)- factors.
Discret. Math., 1990

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

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

A lower bound on the number of spanning trees with <i>k</i> end-vertices.
J. Graph Theory, 1988

A lower bound on connectivities of matroid base graphs.
Discret. Math., 1988


  Loading...