Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Gui Zhen Liu - MaRDI portal

Gui Zhen Liu

From MaRDI portal
(Redirected from Person:189765)
Person:353623

Available identifiers

zbMath Open liu.guizhenMaRDI QIDQ353623

List of research outcomes





PublicationDate of PublicationType
(2,1)-total labelling of planar graphs with large maximum degree2022-04-19Paper
https://portal.mardi4nfdi.de/entity/Q50624712022-03-17Paper
https://portal.mardi4nfdi.de/entity/Q50625592022-03-17Paper
https://portal.mardi4nfdi.de/entity/Q50626682022-03-17Paper
https://portal.mardi4nfdi.de/entity/Q50627102022-03-17Paper
1-平面图的结构性质及其在无圈边染色上的应用2021-12-17Paper
Graphs of \(f\)-class 12018-09-25Paper
Rainbow Matchings in Properly Colored Bipartite Graphs2017-09-01Paper
On total colorings of 1-planar graphs2015-07-01Paper
On the lightness of chordal 4-cycle in 1-planar graphs with high minimum degree2015-01-26Paper
https://portal.mardi4nfdi.de/entity/Q29367172015-01-06Paper
Fractional \(f\)-edge cover chromatic index of graphs2014-06-16Paper
https://portal.mardi4nfdi.de/entity/Q54030012014-03-25Paper
Long properly colored cycles in edge colored complete graphs2014-03-20Paper
Every toroidal graph is acyclically 8-choosable2014-03-18Paper
https://portal.mardi4nfdi.de/entity/Q54010562014-03-12Paper
https://portal.mardi4nfdi.de/entity/Q57473742014-02-14Paper
A NOTE ON RAINBOW MATCHINGS2014-01-28Paper
Total coloring of embedded graphs with maximum degree at least seven2014-01-13Paper
Properties of Hamilton cycles of circuit graphs of matroids2013-11-18Paper
Group edge choosability of planar graphs without adjacent short cycles2013-11-15Paper
On (p,1)-total labelling of plane graphs with independent crossings2013-10-30Paper
https://portal.mardi4nfdi.de/entity/Q28488102013-09-26Paper
On edge colorings of 1-toroidal graphs2013-07-16Paper
https://portal.mardi4nfdi.de/entity/Q28397242013-07-12Paper
https://portal.mardi4nfdi.de/entity/Q49280002013-06-20Paper
\(k\)-forested choosability of graphs with bounded maximum average degree2013-06-12Paper
https://portal.mardi4nfdi.de/entity/Q49249172013-06-10Paper
Nowhere-zero 3-flows in matroid base graph2013-04-08Paper
On edge covering colorings of graphs2013-04-04Paper
A note on relaxed equitable coloring of graphs2013-04-04Paper
https://portal.mardi4nfdi.de/entity/Q49097152013-03-21Paper
List total colorings of planar graphs without triangles at small distance2013-03-18Paper
The structure of plane graphs with independent crossings and its applications to coloring problems2013-02-18Paper
Circular coloring of planar digraphs2013-01-03Paper
A note on heterochromatic \(C_4\) in edge-colored triangle-free graphs2013-01-03Paper
Acyclic edge coloring of planar graphs without small cycles2012-12-27Paper
List edge and list total coloring of 1-planar graphs2012-12-06Paper
Light subgraphs in the family of 1-planar graphs with high minimum degree2012-11-07Paper
New upper bounds on linear coloring of planar graphs2012-11-07Paper
Existence of rainbow matchings in properly edge-colored graphs2012-11-07Paper
A BOUND ON THE BONDAGE NUMBER OF TOROIDAL GRAPHS2012-10-15Paper
https://portal.mardi4nfdi.de/entity/Q31664452012-10-12Paper
https://portal.mardi4nfdi.de/entity/Q31664552012-10-12Paper
https://portal.mardi4nfdi.de/entity/Q29186092012-10-08Paper
Edge covering pseudo-outerplanar graphs with forests2012-09-12Paper
On \(r\)-acyclic edge colorings of planar graphs2012-08-10Paper
(1,λ)-EMBEDDED GRAPHS AND THE ACYCLIC EDGE CHOOSABILITY2012-06-08Paper
https://portal.mardi4nfdi.de/entity/Q28862712012-06-01Paper
List (d,1)-total labelling of graphs embedded in surfaces2012-06-01Paper
https://portal.mardi4nfdi.de/entity/Q28871452012-06-01Paper
On edge colorings of 1-planar graphs without adjacent triangles2012-05-04Paper
LIST EDGE AND LIST TOTAL COLORINGS OF PLANAR GRAPHS WITHOUT 6-CYCLES WITH CHORD2012-04-13Paper
Toughness and \([a, b\)-factors with inclusion\(/\)exclusion properties]2012-03-29Paper
\(k\)-forested choosability of planar graphs and sparse graphs2012-03-16Paper
https://portal.mardi4nfdi.de/entity/Q31150082012-02-20Paper
https://portal.mardi4nfdi.de/entity/Q31150752012-02-20Paper
On \((p,1)\)-total labelling of 1-planar graphs2011-12-12Paper
Total coloring of pseudo-outerplanar graphs2011-08-25Paper
https://portal.mardi4nfdi.de/entity/Q51998312011-08-16Paper
https://portal.mardi4nfdi.de/entity/Q51998422011-08-16Paper
Circular vertex arboricity2011-08-10Paper
Edge Coloring of Triangle-Free 1-Planar Graphs2011-07-19Paper
https://portal.mardi4nfdi.de/entity/Q30117252011-06-29Paper
https://portal.mardi4nfdi.de/entity/Q30117932011-06-29Paper
https://portal.mardi4nfdi.de/entity/Q30118082011-06-29Paper
On \(f\)-edge cover coloring of nearly bipartite graphs2011-05-23Paper
Improved bounds for acyclic chromatic index of planar graphs2011-05-17Paper
The method of coloring in graphs and its application2011-04-05Paper
\(k\)-forested coloring of planar graphs with large girth2011-03-29Paper
Equitable edge-colorings of simple graphs2011-03-21Paper
The existence of even regular factors of regular graphs on the number of cut edges2011-03-02Paper
Total coloring of embedded graphs of maximum degree at least ten2011-02-25Paper
Neighbor set for the existence of \((g,f,n)\)-critical graphs2011-02-10Paper
A note on \([r, s, c, t\)-colorings of graphs]2011-02-10Paper
https://portal.mardi4nfdi.de/entity/Q30702542011-02-02Paper
https://portal.mardi4nfdi.de/entity/Q30702912011-02-02Paper
https://portal.mardi4nfdi.de/entity/Q30703572011-02-02Paper
Total coloring of planar graphs without 6-cycles2011-01-21Paper
Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles2011-01-20Paper
On the fractionalf-chromatic index of a graph2011-01-20Paper
COMPOUND-COMMUTING ADDITIVE MAPS ON MATRIX SPACES2011-01-12Paper
A New Result on [k,k + 1-Factors Containing Given Hamiltonian Cycles]2011-01-10Paper
Vertex-distinguishing edge colorings of graphs with degree sum conditions2010-12-03Paper
Acyclic edge chromatic number of outerplanar graphs2010-11-10Paper
Degree conditions of fractional ID-\(k\)-factor-critical graphs2010-10-14Paper
The connectivity and minimum degree of circuit graphs of matroids2010-09-21Paper
Path embedding in faulty hypercubes2010-09-01Paper
A note on ``The super connectivity of augmented cubes2010-08-16Paper
https://portal.mardi4nfdi.de/entity/Q35726212010-07-08Paper
Edge-choosability of planar graphs without non-induced 5-cycles2010-06-16Paper
On the adjacent vertex distinguishing edge colourings of graphs2010-06-11Paper
List edge and list total colorings of planar graphs without short cycles2010-06-09Paper
The super connectivity of augmented cubes2010-04-19Paper
ON SUPER f-EDGE COVER-COLORING IN MULTIGRAPHS2010-03-11Paper
Total colorings and list total colorings of planar graphs without intersecting 4-cycles2009-12-15Paper
Orthogonal factorizations of digraphs2009-12-14Paper
Acyclic edge colorings of planar graphs and series parallel graphs2009-12-07Paper
https://portal.mardi4nfdi.de/entity/Q36424332009-11-11Paper
Acyclic edge coloring of planar graphs with large girth2009-11-06Paper
Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs2009-10-26Paper
Degree and stability number condition for the existence of connected factors in graphs2009-10-26Paper
Trees with second minimum general Randić index for \(\alpha >0\)2009-10-23Paper
The heterochromatic cycles in edge-colored graphs2009-10-23Paper
https://portal.mardi4nfdi.de/entity/Q53192522009-07-22Paper
The stability number and connected \([k,k+1\)-factor in graphs]2009-06-10Paper
Paths, cycles and circular colorings in digraphs2009-05-28Paper
https://portal.mardi4nfdi.de/entity/Q36249712009-05-06Paper
On 2-factors with cycles containing specified edges in a bipartite graph2009-04-09Paper
Bipartite toughness and \(k\)-factors in bipartite graphs2009-03-30Paper
Graph Factors and Matching Extensions2009-03-12Paper
Notes on Fractional (1,f)-Odd Factors of Graphs2009-03-10Paper
Edge covered critical multigraphs2009-01-28Paper
A note on the edge cover chromatic index of multigraphs2009-01-28Paper
Edge-choosability of planar graphs without adjacent triangles or without 7-cycles2009-01-28Paper
Some Results on Fractional Graph Theory2009-01-13Paper
https://portal.mardi4nfdi.de/entity/Q35459902008-12-18Paper
https://portal.mardi4nfdi.de/entity/Q35405122008-11-24Paper
Fault-tolerant embedding of paths in crossed cubes2008-11-18Paper
A special \(f\)-edge cover-coloring of multigraphs2008-10-21Paper
Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph2008-10-21Paper
A note on the \((g, f)\)-coloring2008-10-21Paper
Characterizations of maximum fractional \((g,f)\)-factors of graphs2008-09-29Paper
Binding number and Hamiltonian (g, f)-factors in graphs II2008-09-24Paper
\(f\)-colorings of some graphs of \(f\)-class 12008-09-09Paper
\(k\) -factors in regular graphs2008-09-09Paper
Total colorings of planar graphs without small cycles2008-08-20Paper
On (n,k)-extendable graphs and induced subgraphs2008-08-12Paper
Paths in circuit graphs of matroids2008-05-28Paper
Hamilton cycles in circuit graphs of matroids2008-05-14Paper
https://portal.mardi4nfdi.de/entity/Q54557802008-04-04Paper
Toughness and the existence of fractional \(k\)-factors of graphs2008-03-13Paper
Maximum fractional factors in graphs2008-02-25Paper
Some graphs of class 1 for \(f\)-colorings2008-02-25Paper
Some results on fractional \(n\)-factor-critical graphs2008-02-22Paper
Some results on binding number and fractional perfect matching2008-02-22Paper
Binding number and Hamiltonian \((g,f)\)-factors in graphs2008-02-22Paper
Some results about f‐critical graphs2008-01-07Paper
https://portal.mardi4nfdi.de/entity/Q54302252007-12-14Paper
Some properties on \(f\)-edge covered critical graphs2007-10-22Paper
Cycles in circuit graphs of matroids2007-10-11Paper
https://portal.mardi4nfdi.de/entity/Q53102452007-09-21Paper
The linear arboricity of planar graphs with no short cycles2007-09-03Paper
Some Topics on Edge-Coloring2007-08-28Paper
https://portal.mardi4nfdi.de/entity/Q34463712007-06-14Paper
https://portal.mardi4nfdi.de/entity/Q34311632007-04-05Paper
https://portal.mardi4nfdi.de/entity/Q34311662007-04-05Paper
https://portal.mardi4nfdi.de/entity/Q34286722007-03-29Paper
https://portal.mardi4nfdi.de/entity/Q34172822007-01-29Paper
Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers2007-01-24Paper
List edge and list total colorings of planar graphs without 4-cycles2007-01-09Paper
Minimal regular 2-graphs and applications2006-12-06Paper
Edge covering coloring of nearly bipartite graphs2006-12-04Paper
On 2-factors with prescribed properties in a bipartite graph2006-10-13Paper
https://portal.mardi4nfdi.de/entity/Q54911582006-10-10Paper
https://portal.mardi4nfdi.de/entity/Q54908572006-10-04Paper
A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 22006-05-16Paper
Circular list colorings of some graphs2006-02-20Paper
Some sufficient conditions for a graph to be of \(C_f\) 12006-01-24Paper
\((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs2006-01-09Paper
On \((g,f)\)-uniform graphs2006-01-05Paper
A polynomial algorithm for finding \((g,f)\)-colorings orthogonal to stars in bipartite graphs2005-11-30Paper
Vertex-disjoint quadrilaterals in bipartite graphs2005-11-21Paper
The classification of complete graphs \(K_n\) on \(f\)-coloring2005-11-21Paper
Properties of fractional \(k\)-factors of graphs2005-08-25Paper
https://portal.mardi4nfdi.de/entity/Q54660982005-08-23Paper
A PTAS FOR MINIMIZING TOTAL COMPLETION TIME OF BOUNDED BATCH SCHEDULING2005-06-22Paper
https://portal.mardi4nfdi.de/entity/Q46796612005-06-21Paper
On \(f\)-edge cover-colouring of simple graphs2005-04-29Paper
https://portal.mardi4nfdi.de/entity/Q46534302005-03-07Paper
\((g,f)\)-factors with special properties in bipartite \((mg,mf)\)-graphs2005-02-24Paper
https://portal.mardi4nfdi.de/entity/Q48271392004-11-16Paper
https://portal.mardi4nfdi.de/entity/Q47375352004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44585442004-03-18Paper
\(f\)-factors in bipartite (\(mf\))-graphs2004-01-26Paper
Number of maximum matchings of bipartite graphs with positive surplus2004-01-26Paper
https://portal.mardi4nfdi.de/entity/Q48080272003-07-14Paper
Some problems on factorizations with constraints in bipartite graphs2003-06-10Paper
https://portal.mardi4nfdi.de/entity/Q48019842003-06-01Paper
Randomly orthogonal \((g,f)\)-factorizations in graphs2003-05-05Paper
https://portal.mardi4nfdi.de/entity/Q47831482003-04-28Paper
https://portal.mardi4nfdi.de/entity/Q48037922003-04-09Paper
The linear arboricity of composition graphs2003-04-09Paper
https://portal.mardi4nfdi.de/entity/Q47830952003-04-02Paper
The fractional matching numbers of graphs2003-03-19Paper
https://portal.mardi4nfdi.de/entity/Q47916332003-01-28Paper
Edge covering coloring and fractional edge covering coloring2002-11-19Paper
Orthogonal factorizations of graphs2002-09-29Paper
https://portal.mardi4nfdi.de/entity/Q45439812002-08-11Paper
https://portal.mardi4nfdi.de/entity/Q45440662002-08-11Paper
Fractional \((g,f)\)-factors of graphs2002-07-14Paper
https://portal.mardi4nfdi.de/entity/Q27443192002-05-20Paper
A generalization of orthogonal factorizations in graphs2002-03-20Paper
Orthogonal \((g,f)\)-factorizations of bipartite graphs2002-03-20Paper
Generalization of matching extensions in graphs2002-02-07Paper
https://portal.mardi4nfdi.de/entity/Q27672872002-01-29Paper
https://portal.mardi4nfdi.de/entity/Q27673202002-01-29Paper
https://portal.mardi4nfdi.de/entity/Q27673762002-01-29Paper
https://portal.mardi4nfdi.de/entity/Q27673772002-01-29Paper
https://portal.mardi4nfdi.de/entity/Q27651422002-01-23Paper
Orthogonal (g, f)-factorizations in networks2001-12-12Paper
https://portal.mardi4nfdi.de/entity/Q27159452001-05-30Paper
https://portal.mardi4nfdi.de/entity/Q49498542001-02-20Paper
https://portal.mardi4nfdi.de/entity/Q45282752001-01-31Paper
https://portal.mardi4nfdi.de/entity/Q45283812001-01-31Paper
On endo-homology of complexes of graphs2000-11-02Paper
\((g,f)\)-factorizations orthogonal to a subgraph of a graph1999-03-22Paper
https://portal.mardi4nfdi.de/entity/Q42216991999-02-21Paper
\((a,b,k)\)-critical graphs1998-11-17Paper
https://portal.mardi4nfdi.de/entity/Q43845971998-10-27Paper
https://portal.mardi4nfdi.de/entity/Q43860851998-07-13Paper
https://portal.mardi4nfdi.de/entity/Q43879001998-05-14Paper
https://portal.mardi4nfdi.de/entity/Q43679591998-03-02Paper
https://portal.mardi4nfdi.de/entity/Q43681541998-01-04Paper
https://portal.mardi4nfdi.de/entity/Q43679731997-12-03Paper
https://portal.mardi4nfdi.de/entity/Q48876841996-12-16Paper
Orthogonal \([k-1,k+1\)-factorizations in graphs]1996-11-25Paper
Orthogonal \((g,f)\)-factorizations in graphs1996-08-13Paper
https://portal.mardi4nfdi.de/entity/Q48844971996-07-15Paper
\((g,f)\)-factorization orthogonal to a star in graphs1996-07-14Paper
https://portal.mardi4nfdi.de/entity/Q48548281995-11-16Paper
On solutions of Alspach's problems1995-03-07Paper
https://portal.mardi4nfdi.de/entity/Q43164571995-03-07Paper
https://portal.mardi4nfdi.de/entity/Q42866311994-06-22Paper
https://portal.mardi4nfdi.de/entity/Q42030421993-11-28Paper
https://portal.mardi4nfdi.de/entity/Q46967921993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40306821993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40243441993-03-09Paper
https://portal.mardi4nfdi.de/entity/Q40261441993-02-21Paper
https://portal.mardi4nfdi.de/entity/Q40256431993-02-18Paper
https://portal.mardi4nfdi.de/entity/Q39848021992-06-27Paper
Proof of a conjecture on matroid base graphs1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39746991992-06-25Paper
A simple existence criterion for \((g<f)\)-factors1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33587501990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34833121990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34874211990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47298311989-01-01Paper
Paths and cycles in matroid base graphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38340881989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47312151988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47312161988-01-01Paper
A lower bound on connectivities of matroid base graphs1988-01-01Paper
Erratum: ``A lower bound on connectivities of matroid base graphs.1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34873821988-01-01Paper
On connectivities of tree graphs1988-01-01Paper
A lower bound on the number of spanning trees withk end-vertices1988-01-01Paper
The connectivities of adjacent tree graphs1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38183581987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37524151986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37739161986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36819481985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37225201985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37433301985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37673811985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37739171985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37787701985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37261341984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37261561984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37261651982-01-01Paper

Research outcomes over time

This page was built for person: Gui Zhen Liu