Hong Wang

68 papers Journal 67
YearRankTypeTitle / Venue / Authors
2024 J jnl
Partial degrees on matchings for cycles in bipartite graphs.
Discret. Math.
Hong Wang
2023 J jnl
Disjoint Cycles in a Digraph with Partial Degree.
SIAM J. Discret. Math.
Hong Wang, Yun Wang, Jin Yan
2021 J jnl
Disjoint directed cycles with specified lengths in directed bipartite graphs.
Discret. Math.
Yunshu Gao, Hong Wang, Qingsong Zou
2020 J jnl
Disjoint cycles covering matchings in graphs with partial degrees.
J. Graph Theory
Hong Wang
2020 J jnl
Disjoint directed cycles in directed graphs.
Discret. Math.
Hong Wang
2019 J jnl
Vertex-disjoint double chorded cycles in bipartite graphs.
Discret. Math.
Yunshu Gao, Xiaoyao Lin, Hong Wang
2018 J jnl
Covering a Graph with Cycles of Length at Least 4.
Electron. J. Comb.
Hong Wang
2018 J jnl
Disjoint cycles of order at least 5.
Australas. J Comb.
Hong Wang
2017 J jnl
Disjoint cycles in graphs with distance degree sum conditions.
Discret. Math.
Zhihui Jiao, Hong Wang, Jin Yan
2016 J jnl
Covering a subset with two cycles.
Australas. J Comb.
Hong Wang
2015 J jnl
Partial Degree Conditions and Cycle Coverings.
J. Graph Theory
Hong Wang
2013 — ch.
The Chromatic Number of the Two-Packing of a Forest.
The Mathematics of Paul Erdős II
Hong Wang, Norbert Sauer
2012 J jnl
An extension of the Corrádi-Hajnal Theorem.
Australas. J Comb.
Hong Wang
2012 J jnl
Disjoint 5-cycles in a graph.
Discuss. Math. Graph Theory
Hong Wang
2010 J jnl
Disjoint triangles and pentagons in a graph.
Australas. J Comb.
Ryan Bauer, Hong Wang
2010 J jnl
Proof of the Erdos-Faudree Conjecture on Quadrilaterals.
Graphs Comb.
Hong Wang
2009 J jnl
Packing two copies of a sparse graph into a graph with restrained maximum degree.
J. Graph Theory
Hong Wang
2007 J jnl
Pentagons and cycle coverings.
J. Graph Theory
Hong Wang
2005 J jnl
Disjoint directed quadrilaterals in a directed graph.
J. Graph Theory
Danhong Zhang, Hong Wang
2005 J jnl
Existence of two disjoint long cycles in graphs.
Discret. Math.
Yoshimi Egawa, Shinya Fujita, Ken-ichi Kawarabayashi, Hong Wang
2005 J jnl
Maximal Total Length Of
Comb.
Hong Wang
2005 J jnl
On large cycles with lengths differing by one or two.
Australas. J Comb.
Hong Wang
2004 J jnl
A minimum degree result for disjoint cycles and forests in bipartite graphs.
Australas. J Comb.
Danhong Zhang, Hong Wang
2004 J jnl
Vertex-disjoint quadrilaterals in graphs.
Discret. Math.
Hong Wang
2003 J jnl
Covering vertices of a graph by k disjoint cycles.
Discret. Math.
Yoshimi Egawa, Mariko Hagita, Ken-ichi Kawarabayashi, Hong Wang
2002 J jnl
An extension of a theorem on cycles containing specified independent edges.
Discret. Math.
Yoshiyasu Ishigami, Hong Wang
2001 J jnl
Directed Bipartite Graphs Containing Every Possible Pair of Directed Cycles.
Ars Comb.
Hong Wang
2001 J jnl
On Covering a Bipartite Graph with Cycles.
SIAM J. Discret. Math.
Hong Wang
2001 J jnl
On Independent Cycles in a Bipartite Graph.
Graphs Comb.
Hong Wang
2001 J jnl
On Quadrilaterals and Cycle Covers in a Bipartite Graph.
Ars Comb.
Hong Wang
2000 J jnl
Digraphs containing every possible pair of dicycles.
J. Graph Theory
Hong Wang
2000 J jnl
Independent Directed Triangles in a Directed Graph.
Graphs Comb.
Hong Wang
2000 J jnl
Large Vertex-Disjoint Cycles in a Bipartite Graph.
Graphs Comb.
Hong Wang
2000 J jnl
On the maximal number of vertices covered by disjoint cycles.
Australas. J Comb.
Hong Wang
2000 J jnl
Vertex-Disjoint Cycles Containing Specified Edges.
Graphs Comb.
Yoshimi Egawa, Ralph J. Faudree, Ervin Györi, Yoshiyasu Ishigami, Richard H. Schelp, Hong Wang
1999 J jnl
Bipartite graphs containing every possible pair of cycles.
Discret. Math.
Hong Wang
1999 J jnl
Covering a bipartite graph with cycles passing through given edges.
Australas. J Comb.
Hong Wang
1999 J jnl
On 2-factors of a bipartite graph.
J. Graph Theory
Hong Wang
1999 J jnl
On Vertex-Disjoint Complete Bipartite Subgraphs in a Bipartite Graph.
Graphs Comb.
Hong Wang
1999 J jnl
On quadrilaterals in a graph.
Discret. Math.
Bert Randerath, Ingo Schiermeyer, Hong Wang
1999 J jnl
On the maximum number of independent cycles in a graph.
Discret. Math.
Hong Wang
1999 J jnl
Proof of a conjecture on cycles in a bipartite graph.
J. Graph Theory
Hong Wang
1998 J jnl
Induced stars in trees.
Australas. J Comb.
David M. Berman, Jiannong Liu, Hong Wang, Larry Wargo
1998 J jnl
Triangles in claw-free graphs.
Discret. Math.
Hong Wang
1998 J jnl
Vertex-Disjoint Triangles in Claw-Free Graphs with Minimum Degree at Least Three.
Comb.
Hong Wang
1998 J jnl
Vertex-disjoint hexagons with chords in a bipartite graph.
Discret. Math.
Hong Wang
1997 J jnl
All trees contain a large induced subgraph having all degrees 1 (mod k).
Discret. Math.
David M. Berman, A. J. Radcliffe, Alex D. Scott, Hong Wang, Larry Wargo
1997 J jnl
Chromatic equivalence classes of certain generalized polygon trees.
Discret. Math.
Yee-Hock Peng, C. H. C. Little, Kee L. Teo, Hong Wang
1997 J jnl
Covering a graph with cycles passing through given edges.
J. Graph Theory
Hong Wang
1997 J jnl
Odd induced subgraphs in graphs of maximum degree three.
Australas. J Comb.
David M. Berman, Hong Wang, Larry Wargo
1997 J jnl
On a Conjecture on Directed Cycles in a Directed Bipartite Graph.
Graphs Comb.
Charles H. C. Little, Kee L. Teo, Hong Wang
1997 J jnl
On vertex-disjoint complete subgraphs of a graph.
Australas. J Comb.
Hong Wang
1997 J jnl
Packing two bipartite graphs into a complete bipartite graph.
J. Graph Theory
Hong Wang
1996 J jnl
On long cycles in a 2-connected bipartite graph.
Graphs Comb.
Hong Wang
1996 J jnl
On the Maximum Number of Independent Cycles in a Bipartite Graph.
J. Comb. Theory B
Hong Wang
1996 J jnl
Packing of three copies of a graph.
J. Graph Theory
Hong Wang, Norbert Sauer
1996 J jnl
Packing two forests into a bipartite graph.
J. Graph Theory
Hong Wang
1996 J jnl
Partition of a directed bipartite graph into two directed cycles.
Discret. Math.
Hong Wang, Charles H. C. Little, Kee L. Teo
1995 J jnl
Covering a graph with cycles.
J. Graph Theory
Hong Wang
1995 J jnl
Two vertex-disjoint cycles in a graph.
Graphs Comb.
Hong Wang
1995 J jnl
Vertex disjoint cycles in a directed graph.
Australas. J Comb.
Charles H. C. Little, Hong Wang
1994 J jnl
Independent cycles with limited size in a graph.
Graphs Comb.
Hong Wang
1994 J jnl
On K
Discret. Math.
Hong Wang
1994 J jnl
Packing a forest with a graph.
Australas. J Comb.
Hong Wang
1994 J jnl
Path factors of bipartite graphs.
J. Graph Theory
Hong Wang
1993 J jnl
P
Discret. Math.
Hong Wang
1993 J jnl
Packing Three Copies of a Tree into a Complete Graph.
Eur. J. Comb.
Hong Wang, Norbert Sauer
1993 J jnl
Partition of a bipartite graph into cycles.
Discret. Math.
Hong Wang