Jianfang Wang

From MaRDI portal
Person:1753345

Available identifiers

zbMath Open wang.jianfangMaRDI QIDQ1753345

List of research outcomes





PublicationDate of PublicationType
Homology cycles and dependent cycles of hypergraphs2018-05-29Paper
On defected colourings of graphs2014-03-14Paper
On the discovery of the cycle-axiom of hypergraphs2011-03-14Paper
https://portal.mardi4nfdi.de/entity/Q30702862011-02-02Paper
https://portal.mardi4nfdi.de/entity/Q30522382010-11-05Paper
Some results on spanning trees2010-10-29Paper
Equitable total coloring of \(F_n \vee W_n\)2009-11-13Paper
Equitable total coloring of some join graphs2009-11-11Paper
An information-lossless decomposition theory of relational information systems2008-12-21Paper
On the vertex-distinguishing-equitable edge chromatic number of some join-graphs2007-10-09Paper
On axioms constituting the foundation of hypergraph theory2006-10-09Paper
On adjacent-vertex-distinguishing total coloring of graphs2005-11-30Paper
https://portal.mardi4nfdi.de/entity/Q57086222005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q53126872005-09-01Paper
https://portal.mardi4nfdi.de/entity/Q54615482005-07-26Paper
Linear vertex arboricity, independence number and clique cover number.2005-07-20Paper
On acyclic and cyclic hypergraphs2004-03-15Paper
https://portal.mardi4nfdi.de/entity/Q44498862004-02-15Paper
https://portal.mardi4nfdi.de/entity/Q47987162003-09-21Paper
Connected factors and spanning trees in graphs2003-08-18Paper
On the monotonicity of \((k;g,h)\)-graphs2003-06-22Paper
A note on the edge-connectivity of cages2003-05-07Paper
Enumeration of maximum acyclic hypergraphs2003-03-19Paper
Partitioning circulant graphs into isomorphic linear forests2003-03-17Paper
https://portal.mardi4nfdi.de/entity/Q45432552003-01-20Paper
On the edge-binding number of some plane graphs2002-09-25Paper
The upper bound of essential cyclomatic numbers of hypergraphs2002-08-29Paper
Adjacent strong edge coloring of graphs2002-08-15Paper
Counting acyclic hypergraphs2002-08-15Paper
https://portal.mardi4nfdi.de/entity/Q44990362002-06-03Paper
Hamiltonian decomposition of complete bipartite \(r\)-hypergraphs2002-06-02Paper
\((a,b,k)\)-critical graphs.2002-01-29Paper
Hamiltonian decomposition of Cayley graphs of orders \(p^2\) and \(pq\)2001-06-13Paper
An upper bound for the independent domination number1999-12-20Paper
A note on the total chromatic number of Halin graphs with maximum degree 41999-11-25Paper
Arboricity and complement of a graph1999-11-03Paper
Paths and cycles of hypergraphs1999-08-24Paper
https://portal.mardi4nfdi.de/entity/Q42310751999-03-15Paper
\((a,b,k)\)-critical graphs1998-11-17Paper
On the relations between arboricity and independent number or covering number1998-11-03Paper
https://portal.mardi4nfdi.de/entity/Q43797531998-08-03Paper
https://portal.mardi4nfdi.de/entity/Q43811451998-04-01Paper
An invariant for hypergraphs1997-06-25Paper
https://portal.mardi4nfdi.de/entity/Q56901091997-02-23Paper
https://portal.mardi4nfdi.de/entity/Q48738051996-04-21Paper
On bandwidth sums of graphs1996-03-11Paper
On upper bounds of bandwidths of trees1996-02-26Paper
Maximum Bandwidth Under Edge Addition1995-08-13Paper
On linear vertex‐arboricity of complementary graphs1994-10-10Paper
A short proof of Nash-Williams' theorem for the arboricity of a graph1994-05-10Paper
https://portal.mardi4nfdi.de/entity/Q42718381994-03-03Paper
Highly irregular digraphs1994-02-28Paper
Factors in graphs with odd-cycle property1993-08-30Paper
https://portal.mardi4nfdi.de/entity/Q52895441993-08-23Paper
https://portal.mardi4nfdi.de/entity/Q40377611993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40378861993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40284781993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q40284661993-03-28Paper
On total covers of graphs1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q39904801992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39777711992-06-25Paper
Total chromatic number of graphs of high degree1990-01-01Paper
Relation between arboricities of a graph and its complement graph1990-01-01Paper
On Erdős's problem of bandwidth of graph adding edge1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33587521990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34800601989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34800731989-01-01Paper
On point-linear arboricity of planar graphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38153161988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42079201988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37755891987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47246721985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51849511985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36825211984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37374511984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33358231983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36580261982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47506561981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39000851980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38624231979-01-01Paper
Orthogonal \((g,f)\)-factorizations of bipartite graphs0001-01-03Paper

Research outcomes over time

This page was built for person: Jianfang Wang