Hong Wang

According to our database1, Hong Wang authored at least 60 papers between 1993 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

Disjoint cycles of order at least 5.
Australasian J. Combinatorics, 2018

2016
Covering a subset with two cycles.
Australasian J. Combinatorics, 2016

2015
Partial Degree Conditions and Cycle Coverings.
Journal of 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.
Discussiones Mathematicae Graph Theory, 2012

An extension of the Corrádi-Hajnal Theorem.
Australasian J. Combinatorics, 2012

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

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

2007
Pentagons and cycle coverings.
Journal of Graph Theory, 2007

2005
Disjoint directed quadrilaterals in a directed graph.
Journal of Graph Theory, 2005

Existence of two disjoint long cycles in graphs.
Discrete Mathematics, 2005

Maximal Total Length Of k Disjoint Cycles In Bipartite Graphs.
Combinatorica, 2005

On large cycles with lengths differing by one or two.
Australasian J. Combinatorics, 2005

2004
Vertex-disjoint quadrilaterals in graphs.
Discrete Mathematics, 2004

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

2003
Covering vertices of a graph by k disjoint cycles.
Discrete Mathematics, 2003

2002
An extension of a theorem on cycles containing specified independent edges.
Discrete Mathematics, 2002

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

On Independent Cycles in a Bipartite Graph.
Graphs and Combinatorics, 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.
Journal of Graph Theory, 2000

Independent Directed Triangles in a Directed Graph.
Graphs and Combinatorics, 2000

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

Vertex-Disjoint Cycles Containing Specified Edges.
Graphs and Combinatorics, 2000

On the maximal number of vertices covered by disjoint cycles.
Australasian J. Combinatorics, 2000

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

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

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

Bipartite graphs containing every possible pair of cycles.
Discrete Mathematics, 1999

On the maximum number of independent cycles in a graph.
Discrete Mathematics, 1999

On quadrilaterals in a graph.
Discrete Mathematics, 1999

Covering a bipartite graph with cycles passing through given edges.
Australasian J. Combinatorics, 1999

1998
Triangles in claw-free graphs.
Discrete Mathematics, 1998

Vertex-disjoint hexagons with chords in a bipartite graph.
Discrete Mathematics, 1998

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

Induced stars in trees.
Australasian J. Combinatorics, 1998

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

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

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

Chromatic equivalence classes of certain generalized polygon trees.
Discrete Mathematics, 1997

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

On vertex-disjoint complete subgraphs of a graph.
Australasian J. Combinatorics, 1997

Odd induced subgraphs in graphs of maximum degree three.
Australasian J. Combinatorics, 1997

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

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

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

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

Partition of a directed bipartite graph into two directed cycles.
Discrete Mathematics, 1996

1995
Covering a graph with cycles.
Journal of Graph Theory, 1995

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

Vertex disjoint cycles in a directed graph.
Australasian J. Combinatorics, 1995

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

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

On K1, k-factorizations of a complete bipartite graph.
Discrete Mathematics, 1994

Packing a forest with a graph.
Australasian J. Combinatorics, 1994

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

P2p-factorization of a complete bipartite graph.
Discrete Mathematics, 1993

Partition of a bipartite graph into cycles.
Discrete Mathematics, 1993


  Loading...