Han Ren

From MaRDI portal
Person:187139

Available identifiers

zbMath Open ren.hanMaRDI QIDQ187139

List of research outcomes

PublicationDate of PublicationType
Upper bounds on the chromatic polynomial of a connected graph with fixed clique number2023-05-26Paper
The number of copies of \(K_{2,t+1}\) in a graph2022-08-18Paper
Nonseparating independent sets and maximum genus of graphs2022-07-15Paper
The number of 4-cycles in a graph2022-06-03Paper
Dynamical Analysis of Border Collision Bifurcation in One-Cycle Controlled Single-Inductor Dual-Output Boost DC-DC Converters2022-04-28Paper
https://portal.mardi4nfdi.de/entity/Q50625822022-03-17Paper
Mean color numbers of some graphs2022-01-03Paper
Distributions of near-4-regular maps on the sphere and the projective plane2021-11-30Paper
Upper bounds for the independence polynomial of graphs at \(-1\)2021-08-24Paper
https://portal.mardi4nfdi.de/entity/Q49960382021-07-01Paper
https://portal.mardi4nfdi.de/entity/Q33856952021-01-14Paper
https://portal.mardi4nfdi.de/entity/Q33857072021-01-14Paper
https://portal.mardi4nfdi.de/entity/Q33859162021-01-14Paper
https://portal.mardi4nfdi.de/entity/Q51275252020-10-27Paper
https://portal.mardi4nfdi.de/entity/Q51277592020-10-27Paper
https://portal.mardi4nfdi.de/entity/Q51278132020-10-27Paper
A Recursive Method for Perfect Matching Number Classified with Saturation of a Certain Vertex2020-08-12Paper
https://portal.mardi4nfdi.de/entity/Q33071712020-08-12Paper
https://portal.mardi4nfdi.de/entity/Q33080062020-08-12Paper
4-edge-connected 4-regular maps on the projective plane2020-07-21Paper
Nonseparating independent sets of Cartesian product graphs2020-02-28Paper
The orientable genus of the join of a cycle and a complete graph2020-02-21Paper
The number of ordered splits where the components of a positive integer n are not less than 22020-01-22Paper
https://portal.mardi4nfdi.de/entity/Q52091412020-01-22Paper
https://portal.mardi4nfdi.de/entity/Q52095882020-01-22Paper
https://portal.mardi4nfdi.de/entity/Q52097602020-01-22Paper
Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs2020-01-08Paper
https://portal.mardi4nfdi.de/entity/Q52063882019-12-18Paper
New formulae for the bipartite vertex frustration and decycling number of graphs2019-11-26Paper
Extending colorings of planar graphs2019-11-06Paper
https://portal.mardi4nfdi.de/entity/Q51941082019-09-20Paper
Odd components of co-trees and graph embeddings2019-03-21Paper
Finding a shortest cycle in a subspace of the cycle space of a graph2019-03-18Paper
https://portal.mardi4nfdi.de/entity/Q46236562019-02-22Paper
https://portal.mardi4nfdi.de/entity/Q46136602019-01-24Paper
Bounds for judicious balanced bipartitions of graphs2019-01-11Paper
A note on decycling number, vertex partition and AVD-total coloring in graphs2019-01-11Paper
New formulae for the decycling number of graphs2018-12-05Paper
https://portal.mardi4nfdi.de/entity/Q46833362018-09-20Paper
The decycling number and maximum genus of cubic graphs2018-08-16Paper
https://portal.mardi4nfdi.de/entity/Q31753262018-07-18Paper
https://portal.mardi4nfdi.de/entity/Q46429232018-05-25Paper
https://portal.mardi4nfdi.de/entity/Q31314082018-01-29Paper
https://portal.mardi4nfdi.de/entity/Q31323682018-01-29Paper
https://portal.mardi4nfdi.de/entity/Q45989802017-12-15Paper
Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\)2017-12-12Paper
https://portal.mardi4nfdi.de/entity/Q53676282017-10-20Paper
https://portal.mardi4nfdi.de/entity/Q53683932017-10-20Paper
A new formula for the decycling number of regular graphs2017-09-18Paper
https://portal.mardi4nfdi.de/entity/Q52763592017-07-14Paper
The decycling number and vertex coloring of Halin graphs2017-07-14Paper
https://portal.mardi4nfdi.de/entity/Q52769842017-07-14Paper
https://portal.mardi4nfdi.de/entity/Q29783042017-04-21Paper
https://portal.mardi4nfdi.de/entity/Q31798992017-01-06Paper
https://portal.mardi4nfdi.de/entity/Q31803072017-01-06Paper
https://portal.mardi4nfdi.de/entity/Q31806372017-01-06Paper
Minimum genus embeddings of the complete graph2016-11-02Paper
https://portal.mardi4nfdi.de/entity/Q28288682016-10-26Paper
https://portal.mardi4nfdi.de/entity/Q28290392016-10-26Paper
https://portal.mardi4nfdi.de/entity/Q28241172016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q29921522016-08-10Paper
A cycle cover of a 2-edge-connected graph embedded with large face-width on an orientable surface2016-07-22Paper
The cycle's structure of embedded graphs in surfaces2016-05-04Paper
A note on graph proper total colorings with many distinguishing constraints2016-04-06Paper
Finding shorter cycles in a weighted graph2016-03-02Paper
Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)2015-07-22Paper
https://portal.mardi4nfdi.de/entity/Q52569122015-06-29Paper
Vertex Splitting and Upper Embeddable Graphs2015-06-29Paper
https://portal.mardi4nfdi.de/entity/Q52575872015-06-29Paper
https://portal.mardi4nfdi.de/entity/Q52600522015-06-29Paper
https://portal.mardi4nfdi.de/entity/Q52606142015-06-29Paper
https://portal.mardi4nfdi.de/entity/Q29271582014-11-03Paper
https://portal.mardi4nfdi.de/entity/Q29273182014-11-03Paper
https://portal.mardi4nfdi.de/entity/Q29273852014-11-03Paper
Counting 2-connected 4-regular maps on the projective plane2014-09-04Paper
https://portal.mardi4nfdi.de/entity/Q49806782014-06-30Paper
https://portal.mardi4nfdi.de/entity/Q49810402014-06-30Paper
Lower bound on the number of the maximum genus embedding of $K_{n,n}$2014-02-19Paper
https://portal.mardi4nfdi.de/entity/Q53972342014-02-19Paper
The nonorientable genus of the join of two cycles2013-12-05Paper
https://portal.mardi4nfdi.de/entity/Q28601142013-11-19Paper
https://portal.mardi4nfdi.de/entity/Q49259792013-06-20Paper
https://portal.mardi4nfdi.de/entity/Q49267462013-06-20Paper
https://portal.mardi4nfdi.de/entity/Q49269662013-06-20Paper
https://portal.mardi4nfdi.de/entity/Q49275752013-06-20Paper
https://portal.mardi4nfdi.de/entity/Q49008262013-01-24Paper
https://portal.mardi4nfdi.de/entity/Q49010582013-01-24Paper
https://portal.mardi4nfdi.de/entity/Q49011622013-01-24Paper
Exponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\)2012-12-27Paper
https://portal.mardi4nfdi.de/entity/Q29180412012-10-05Paper
https://portal.mardi4nfdi.de/entity/Q28858892012-06-01Paper
Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs2012-05-14Paper
The extremal genus embedding of graphs2012-03-05Paper
https://portal.mardi4nfdi.de/entity/Q31090152012-01-27Paper
https://portal.mardi4nfdi.de/entity/Q31093412012-01-27Paper
https://portal.mardi4nfdi.de/entity/Q31093422012-01-27Paper
https://portal.mardi4nfdi.de/entity/Q31104122012-01-27Paper
Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\)2012-01-24Paper
https://portal.mardi4nfdi.de/entity/Q31695312011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q31698742011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q31700502011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q31709402011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q31709452011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q30171722011-07-19Paper
The projective plane crossing numbers of circular graphs2010-12-14Paper
Enumerative properties of rooted circuit maps2010-11-12Paper
Finding short cycles in embedded graph in polynomial time2010-06-23Paper
https://portal.mardi4nfdi.de/entity/Q35612602010-05-25Paper
https://portal.mardi4nfdi.de/entity/Q34048532010-02-12Paper
https://portal.mardi4nfdi.de/entity/Q34050722010-02-12Paper
https://portal.mardi4nfdi.de/entity/Q34052212010-02-12Paper
Fundamental cycles and graph embeddings2009-12-11Paper
Exponentially many maximum genus embeddings and genus embeddings for complete graphs2009-12-07Paper
Minor and minimum cycle bases of a 3-connected planar graph2009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q36407202009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q36419572009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q36422862009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q53196302009-07-22Paper
Short cycle structure of graphs on surfaces. I: The uniqueness theorems2008-10-27Paper
https://portal.mardi4nfdi.de/entity/Q35181702008-08-06Paper
https://portal.mardi4nfdi.de/entity/Q35156322008-07-29Paper
https://portal.mardi4nfdi.de/entity/Q54539222008-04-03Paper
https://portal.mardi4nfdi.de/entity/Q54539252008-04-03Paper
Minimum cycle bases of graphs on surfaces2007-11-27Paper
https://portal.mardi4nfdi.de/entity/Q53096402007-10-09Paper
https://portal.mardi4nfdi.de/entity/Q52934492007-07-02Paper
https://portal.mardi4nfdi.de/entity/Q34156932007-01-19Paper
Short cycle structures for graphs on surfaces and an open problem of Mohar and Thomassen2006-12-06Paper
https://portal.mardi4nfdi.de/entity/Q54905462006-10-04Paper
https://portal.mardi4nfdi.de/entity/Q54876392006-09-11Paper
https://portal.mardi4nfdi.de/entity/Q54813862006-08-09Paper
https://portal.mardi4nfdi.de/entity/Q33704532006-02-07Paper
https://portal.mardi4nfdi.de/entity/Q33679292006-01-26Paper
The crossing number of the circular graph \(C(2m+2,m)\)2005-12-29Paper
https://portal.mardi4nfdi.de/entity/Q56985942005-10-27Paper
https://portal.mardi4nfdi.de/entity/Q46725912005-05-03Paper
Cycle spaces of graphs on the sphere and the projective plane2005-04-29Paper
Bisingular maps on some surfaces2005-01-31Paper
Maximum genus of strong embeddings2004-06-22Paper
Enumeration of 2-connected loopless 4-regular maps on the plane2003-02-11Paper
4-regular maps on the Klein bottle2002-12-10Paper
The number of loopless \(4\)-regular maps on the projective plane2002-12-10Paper
https://portal.mardi4nfdi.de/entity/Q31540852002-11-14Paper
Enumeration of simple bipartite maps on the sphere and the projective plane2002-10-24Paper
https://portal.mardi4nfdi.de/entity/Q45490062002-08-27Paper
https://portal.mardi4nfdi.de/entity/Q45490922002-08-27Paper
https://portal.mardi4nfdi.de/entity/Q45426642002-08-25Paper
Enumerating near-4-regular maps on the sphere and the torus2002-02-17Paper
https://portal.mardi4nfdi.de/entity/Q47615342001-09-18Paper
Bisingular maps on the sphere and the projective plane2001-07-23Paper
https://portal.mardi4nfdi.de/entity/Q27150632001-06-20Paper
https://portal.mardi4nfdi.de/entity/Q45048402000-11-21Paper
https://portal.mardi4nfdi.de/entity/Q45048562000-09-14Paper
On the number of fair triangulations2000-07-09Paper
https://portal.mardi4nfdi.de/entity/Q49378172000-06-09Paper
Counting rooted near-4-regular Eulerian maps on some surfaces1999-11-23Paper
Enumeration of rooted planar Halin maps1999-08-12Paper
https://portal.mardi4nfdi.de/entity/Q38405571999-03-02Paper
https://portal.mardi4nfdi.de/entity/Q43055271995-07-11Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Han Ren