Hong Wang 0022 - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2013

The Chromatic Number of the Two-Packing of a ForestHong Wang 0022, Norbert Sauer. In Ronald L. Graham, Jaroslav Nesetril, Steve Butler, editors, The Mathematics of Paul Erdős II. pages 143-166, Springer, 2013. [doi]

2007

Pentagons and cycle coveringsHong Wang 0022. jgt, 54(3):194-208, 2007. [doi]

2005

Maximal Total Length Of ::::k:::: Disjoint Cycles In Bipartite GraphsHong Wang 0022. combinatorica, 25(3):367-377, 2005. [doi]

Existence of two disjoint long cycles in graphsYoshimi Egawa, Shinya Fujita, Ken-ichi Kawarabayashi, Hong Wang 0022. DM, 305(1-3):154-169, 2005. [doi]

Disjoint directed quadrilaterals in a directed graphDanhong Zhang, Hong Wang 0022. jgt, 50(2):91-104, 2005. [doi]

2004

Vertex-disjoint quadrilaterals in graphsHong Wang 0022. DM, 288(1-3):149-166, 2004. [doi]

2003

Covering vertices of a graph by k disjoint cyclesYoshimi Egawa, Mariko Hagita, Ken-ichi Kawarabayashi, Hong Wang 0022. DM, 270(1-3):114-124, 2003. [doi]

2002

An extension of a theorem on cycles containing specified independent edgesYoshiyas Ishigami, Hong Wang 0022. DM, 245(1-3):127-137, 2002. [doi]

2001

On Independent Cycles in a Bipartite GraphHong Wang 0022. gc, 17(1):177-183, 2001. [doi]

On Quadrilaterals and Cycle Covers in a Bipartite GraphHong Wang 0022. arscom, 58, 2001.

Directed Bipartite Graphs Containing Every Possible Pair of Directed CyclesHong Wang 0022. arscom, 60, 2001.

On Covering a Bipartite Graph with CyclesHong Wang 0022. siamdm, 15(1):86-96, 2001. [doi]

2000

Vertex-Disjoint Cycles Containing Specified EdgesYoshimi Egawa, Ralph J. Faudree, Ervin Györi, Yoshiyasu Ishigami, Richard H. Schelp, Hong Wang 0022. gc, 16(1):81-92, 2000. [doi]

1999

Bipartite graphs containing every possible pair of cyclesHong Wang 0022. DM, 207(1-3):233-242, 1999. [doi]

On the maximum number of independent cycles in a graphHong Wang 0022. DM, 205(1-3):183-190, 1999. [doi]

On quadrilaterals in a graphBert Randerath, Ingo Schiermeyer, Hong Wang 0022. DM, 203(1-3):229-237, 1999. [doi]

1998

Triangles in claw-free graphsHong Wang 0022. DM, 187(1-3):233-244, 1998. [doi]

Vertex-disjoint hexagons with chords in a bipartite graphHong Wang 0022. DM, 187(1-3):221-231, 1998. [doi]

Vertex-Disjoint Triangles in Claw-Free Graphs with Minimum Degree at Least ThreeHong Wang 0022. combinatorica, 18(3):441-447, 1998. [doi]

1997

All trees contain a large induced subgraph having all degrees 1 (mod k)David M. Berman, A. J. Radcliffe, Alex D. Scott, Hong Wang 0022, Larry Wargo. DM, 175(1-3):35-40, 1997. [doi]

On a Conjecture on Directed Cycles in a Directed Bipartite GraphCharles H. C. Little, Kee L. Teo, Hong Wang 0022. gc, 13(3):267-273, 1997. [doi]

1996

Partition of a directed bipartite graph into two directed cyclesHong Wang 0022, Charles H. C. Little, Kee L. Teo. DM, 160(1-3):283-289, 1996. [doi]

On the Maximum Number of Independent Cycles in a Bipartite GraphHong Wang 0022. JCT, 67(1):152-164, 1996. [doi]

Packing of three copies of a graphHong Wang 0022, Norbert Sauer. jgt, 21(1):71-80, 1996. [doi]

1994

On K::1, k::-factorizations of a complete bipartite graphHong Wang 0022. DM, 126(1-3):359-364, 1994. [doi]

1993

Partition of a bipartite graph into cyclesHong Wang 0022. DM, 117(1-3):287-291, 1993. [doi]

P::2p::-factorization of a complete bipartite graphHong Wang 0022. DM, 120(1-3):307-308, 1993. [doi]

Packing Three Copies of a Tree into a Complete GraphHong Wang 0022, Norbert Sauer. ejc, 14(2):137-142, 1993. [doi]

Sign in or sign up to see more results.

runs on WebDSL