#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1998

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jianzhuan Wu, Wensong Lin
- Discrete Mathematics
- 2008

The strong chromatic index of a graph G is the minimum integer k such that the edge set of G can be partitioned into k induced matchings. Faudree et al. (1990) 205–211] proposed an open problem: If G is bipartite and if for each edge x y ∈ E(G), d(x) + d(y) ≤ 5, then sχ (G) ≤ 6. Let H 0 be the graph obtained from a 5-cycle by adding a new vertex and joining… (More)

- Jianzhuan Wu, Wensong Lin
- Ars Comb.
- 1998

This paper studies circular chromatic numbers and fractional chromatic numbers of distance graphs G(Z , D) for various distance sets D. In particular, we determine these numbers for those D sets of size two, for some special D sets of size three, for D = {1,

- Wensong Lin, Jianzhuan Wu, Peter Che Bor Lam, Guohua Gu
- Discrete Applied Mathematics
- 2006

- J. WU
- 2008

Let X be a co-H-space of (p − 1)-cell complex with all cells in even dimensions. Then the loop space ΩX admits a retract ¯ A min (X) that is the evaluation of the functor ¯ A min on X. In this paper, we determine the homology H * (¯ A min (X)) and give the EHP sequence for the spaces ¯ A min (X).

- Wensong Lin, Jianzhuan Wu
- J. Comb. Optim.
- 2013

- Peter Che Bor Lam, Wensong Lin, Jianzhuan Wu
- J. Comb. Optim.
- 2007

- ‹
- 1
- ›