Chi Wang

According to our database, Chi Wang authored at least 11 papers between 1991 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2001

The center function on trees.

Fred R. McMorris, Fred S. Roberts, Chi Wang

Networks, 2001

Tagged Probe Interval Graphs.

Li Sheng, Chi Wang, Peisen Zhang

J. Comb. Optim., 2001

2000

Clique covering the edges of a locally cobipartite graph.

Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel, Edward R. Scheinerman, Chi Wang

Discret. Math., 2000

1999

Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling.

André E. Kézdy, Chi Wang

Discret. Math., 1999

On the perfectness of tagged probe interval graphs.

Li Sheng, Chi Wang, Peisen Zhang

Proceedings of the Discrete Mathematical Problems with Medical Applications, 1999

1998

On Probe Interval Graphs.

Fred R. McMorris, Chi Wang, Peisen Zhang

Discret. Appl. Math., 1998

1996

Partitioning Permutations into Increasing and Decreasing Subsequences.

André E. Kézdy, Hunter S. Snevily, Chi Wang

J. Comb. Theory A, 1996

Modular intersection graphs.

Fred R. McMorris, Chi Wang

Graphs Comb., 1996

1992

Addendum to the threshold order of a Boolean function.

Chi Wang, A. C. Williams

Discret. Appl. Math., 1992

1991

The threshold weight of a graph.

Chi Wang, A. C. Williams

J. Graph Theory, 1991

The threshold order of a Boolean function.

Chi Wang, A. C. Williams

Discret. Appl. Math., 1991