Hong Wang

From MaRDI portal
Person:185081

Available identifiers

zbMath Open wang.hong.2MaRDI QIDQ185081

List of research outcomes





PublicationDate of PublicationType
Partial degrees on matchings for cycles in bipartite graphs2024-07-10Paper
Disjoint Cycles in a Digraph with Partial Degree2023-03-30Paper
https://portal.mardi4nfdi.de/entity/Q50743932022-05-09Paper
https://portal.mardi4nfdi.de/entity/Q51534832021-09-29Paper
Disjoint directed cycles with specified lengths in directed bipartite graphs2021-03-25Paper
Disjoint directed cycles in directed graphs2020-06-08Paper
Disjoint cycles covering matchings in graphs with partial degrees2020-05-21Paper
Vertex-disjoint double chorded cycles in bipartite graphs2019-07-18Paper
https://portal.mardi4nfdi.de/entity/Q46147882019-01-31Paper
https://portal.mardi4nfdi.de/entity/Q46160922019-01-30Paper
Covering a graph with cycles of length at least 42018-05-25Paper
Disjoint cycles in graphs with distance degree sum conditions2017-08-29Paper
Covering a subset with two cycles2016-09-14Paper
Partial Degree Conditions and Cycle Coverings2015-03-24Paper
DISJOINT CYCLES WITH PRESCRIBED LENGTHS AND INDEPENDENT EDGES IN GRAPHS2014-09-24Paper
Packing four copies of a tree into a complete graph2014-08-15Paper
Disjoint long cycles in a graph2014-03-21Paper
An extension of the Corrádi-Hajnal theorem2014-01-03Paper
Disjoint 5-cycles in a graph2012-11-08Paper
Packing three copies of a tree into a complete bipartite graph2012-01-24Paper
Proof of the Erdős-Faudree conjecture on quadrilaterals2010-12-03Paper
https://portal.mardi4nfdi.de/entity/Q35658582010-06-07Paper
Packing two copies of a sparse graph into a graph with restrained maximum degree2009-12-18Paper
Disjoint triangles and quadrilaterals in a graph2009-01-05Paper
Pentagons and cycle coverings2007-03-20Paper
Maximal total length of \(k\) disjoint cycles in bitpartite graphs2006-01-26Paper
Existence of two disjoint long cycles in graphs2006-01-10Paper
https://portal.mardi4nfdi.de/entity/Q57090122005-11-21Paper
Disjoint directed quadrilaterals in a directed graph2005-11-07Paper
https://portal.mardi4nfdi.de/entity/Q54614472005-07-26Paper
On quadrilaterals and cycle covers in a bipartite graph.2005-07-20Paper
Vertex-disjoint quadrilaterals in graphs2005-01-13Paper
https://portal.mardi4nfdi.de/entity/Q48187822004-10-01Paper
Covering vertices of a graph by \(k\) disjoint cycles2003-09-04Paper
Independent directed triangles in a directed graph2002-07-22Paper
On independent cycles in a bipartite graph2002-07-22Paper
An extension of a theorem on cycles containing specified independent edges2002-05-15Paper
On covering a bipartite graph with cycles2002-04-23Paper
Large vertex-disjoint cycles in a bipartite graph2001-06-28Paper
Proof of a conjecture on cycles in a bipartite graph2001-03-15Paper
https://portal.mardi4nfdi.de/entity/Q45264012001-01-16Paper
Vertex-disjoint cycles containing specified edges2001-01-02Paper
https://portal.mardi4nfdi.de/entity/Q44885682000-12-11Paper
Vertex-disjoint hexagons with chords in a bipartite graph2000-11-02Paper
Triangles in claw-free graphs2000-11-02Paper
Digraphs containing every possible pair of dicycles2000-10-18Paper
On a conjecture on directed cycles in a directed bipartite graph2000-06-21Paper
On the maximum number of independent cycles in a graph2000-05-08Paper
Bipartite graphs containing every possible pair of cycles2000-05-08Paper
On vertex-disjoint complete bipartite subgraphs in a bipartite graph2000-02-16Paper
https://portal.mardi4nfdi.de/entity/Q42622341999-12-05Paper
On 2-factors of a bipartite graph1999-11-10Paper
Covering a graph with cycles1999-10-17Paper
Vertex-disjoint triangles in claw-free graphs with minimum degree at least three1999-09-14Paper
On quadrilaterals in a graph1999-09-12Paper
https://portal.mardi4nfdi.de/entity/Q42220921998-12-06Paper
All trees contain a large induced subgraph having all degrees 1 (mod \(k\))1998-07-06Paper
https://portal.mardi4nfdi.de/entity/Q43595831998-03-02Paper
Packing two bipartite graphs into a complete bipartite graph1998-02-23Paper
Partition of a directed bipartite graph into two directed cycles1998-01-19Paper
https://portal.mardi4nfdi.de/entity/Q43496141997-12-07Paper
Covering a graph with cycles passing through given edges1997-10-28Paper
On long cycles in a 2-connected bipartite graph1997-06-22Paper
On the maximum number of independent cycles in a bipartite graph1997-04-07Paper
https://portal.mardi4nfdi.de/entity/Q56890031997-03-11Paper
Packing two forests into a bipartite graph1996-10-07Paper
Packing of three copies of a graph1996-08-18Paper
Two vertex-disjoint cycles in a graph1996-02-13Paper
https://portal.mardi4nfdi.de/entity/Q48581501995-12-12Paper
Independent cycles with limited size in a graph1995-06-08Paper
https://portal.mardi4nfdi.de/entity/Q43252941995-03-28Paper
On \(K_{1,k}\)-factorizations of a complete bipartite graph1994-04-04Paper
Path factors of bipartite graphs1994-01-01Paper
\(P_{2p}\)-factorization of a complete bipartite graph1993-12-15Paper
Partition of a bipartite graph into cycles1993-11-01Paper
Packing three copies of a tree into a complete graph1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q37516011986-01-01Paper

Research outcomes over time

This page was built for person: Hong Wang