Hong Wang

Orcid: 0000-0003-0803-1111

Affiliations:
  • University of Idaho, Department of Mathematics, Moscow, ID, USA
  • University of New Orleans, Department of Mathematics, LA, USA (former)
  • University of Calgary, Department of Mathematics and Statistics, AB, Canada (former)


According to our database1, Hong Wang authored at least 68 papers between 1993 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Partial degrees on matchings for cycles in bipartite graphs.
Discret. Math., 2024

2023
Disjoint Cycles in a Digraph with Partial Degree.
SIAM J. Discret. Math., March, 2023

2021
Disjoint directed cycles with specified lengths in directed bipartite graphs.
Discret. Math., 2021

2020
Disjoint cycles covering matchings in graphs with partial degrees.
J. Graph Theory, 2020

Disjoint directed cycles in directed graphs.
Discret. Math., 2020

2019
Vertex-disjoint double chorded cycles in bipartite graphs.
Discret. Math., 2019

2018
Covering a Graph with Cycles of Length at Least 4.
Electron. J. Comb., 2018

Disjoint cycles of order at least 5.
Australas. J Comb., 2018

2017
Disjoint cycles in graphs with distance degree sum conditions.
Discret. Math., 2017

2016
Covering a subset with two cycles.
Australas. J Comb., 2016

2015
Partial Degree Conditions and Cycle Coverings.
J. Graph Theory, 2015

2013
The Chromatic Number of the Two-Packing of a Forest.
Proceedings of the Mathematics of Paul Erdős II, 2013

2012
Disjoint 5-cycles in a graph.
Discuss. Math. Graph Theory, 2012

An extension of the Corrádi-Hajnal Theorem.
Australas. J Comb., 2012

2010
Proof of the Erdos-Faudree Conjecture on Quadrilaterals.
Graphs Comb., 2010

Disjoint triangles and pentagons in a graph.
Australas. J Comb., 2010

2009
Packing two copies of a sparse graph into a graph with restrained maximum degree.
J. Graph Theory, 2009

2007
Pentagons and cycle coverings.
J. Graph Theory, 2007

2005
Disjoint directed quadrilaterals in a directed graph.
J. Graph Theory, 2005

Existence of two disjoint long cycles in graphs.
Discret. Math., 2005

Maximal Total Length Of <i>k</i> Disjoint Cycles In Bipartite Graphs.
Comb., 2005

On large cycles with lengths differing by one or two.
Australas. J Comb., 2005

2004
Vertex-disjoint quadrilaterals in graphs.
Discret. Math., 2004

A minimum degree result for disjoint cycles and forests in bipartite graphs.
Australas. J Comb., 2004

2003
Covering vertices of a graph by k disjoint cycles.
Discret. Math., 2003

2002
An extension of a theorem on cycles containing specified independent edges.
Discret. Math., 2002

2001
On Covering a Bipartite Graph with Cycles.
SIAM J. Discret. Math., 2001

On Independent Cycles in a Bipartite Graph.
Graphs Comb., 2001

On Quadrilaterals and Cycle Covers in a Bipartite Graph.
Ars Comb., 2001

Directed Bipartite Graphs Containing Every Possible Pair of Directed Cycles.
Ars Comb., 2001

2000
Digraphs containing every possible pair of dicycles.
J. Graph Theory, 2000

Independent Directed Triangles in a Directed Graph.
Graphs Comb., 2000

Large Vertex-Disjoint Cycles in a Bipartite Graph.
Graphs Comb., 2000

Vertex-Disjoint Cycles Containing Specified Edges.
Graphs Comb., 2000

On the maximal number of vertices covered by disjoint cycles.
Australas. J Comb., 2000

1999
Proof of a conjecture on cycles in a bipartite graph.
J. Graph Theory, 1999

On 2-factors of a bipartite graph.
J. Graph Theory, 1999

On Vertex-Disjoint Complete Bipartite Subgraphs in a Bipartite Graph.
Graphs Comb., 1999

Bipartite graphs containing every possible pair of cycles.
Discret. Math., 1999

On the maximum number of independent cycles in a graph.
Discret. Math., 1999

On quadrilaterals in a graph.
Discret. Math., 1999

Covering a bipartite graph with cycles passing through given edges.
Australas. J Comb., 1999

1998
Triangles in claw-free graphs.
Discret. Math., 1998

Vertex-disjoint hexagons with chords in a bipartite graph.
Discret. Math., 1998

Vertex-Disjoint Triangles in Claw-Free Graphs with Minimum Degree at Least Three.
Comb., 1998

Induced stars in trees.
Australas. J Comb., 1998

1997
Covering a graph with cycles passing through given edges.
J. Graph Theory, 1997

Packing two bipartite graphs into a complete bipartite graph.
J. Graph Theory, 1997

On a Conjecture on Directed Cycles in a Directed Bipartite Graph.
Graphs Comb., 1997

Chromatic equivalence classes of certain generalized polygon trees.
Discret. Math., 1997

All trees contain a large induced subgraph having all degrees 1 (mod k).
Discret. Math., 1997

On vertex-disjoint complete subgraphs of a graph.
Australas. J Comb., 1997

Odd induced subgraphs in graphs of maximum degree three.
Australas. J Comb., 1997

1996
Packing two forests into a bipartite graph.
J. Graph Theory, 1996

Packing of three copies of a graph.
J. Graph Theory, 1996

On the Maximum Number of Independent Cycles in a Bipartite Graph.
J. Comb. Theory B, 1996

On long cycles in a 2-connected bipartite graph.
Graphs Comb., 1996

Partition of a directed bipartite graph into two directed cycles.
Discret. Math., 1996

1995
Covering a graph with cycles.
J. Graph Theory, 1995

Two vertex-disjoint cycles in a graph.
Graphs Comb., 1995

Vertex disjoint cycles in a directed graph.
Australas. J Comb., 1995

1994
Path factors of bipartite graphs.
J. Graph Theory, 1994

Independent cycles with limited size in a graph.
Graphs Comb., 1994

On K<sub>1, k</sub>-factorizations of a complete bipartite graph.
Discret. Math., 1994

Packing a forest with a graph.
Australas. J Comb., 1994

1993
Packing Three Copies of a Tree into a Complete Graph.
Eur. J. Comb., 1993

P<sub>2p</sub>-factorization of a complete bipartite graph.
Discret. Math., 1993

Partition of a bipartite graph into cycles.
Discret. Math., 1993


  Loading...