K. H. Chew

According to our database, K. H. Chew authored at least 6 papers between 1992 and 1999.

Collaborative distances:

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

1999

Total chromatic number of graphs of odd order and high degree.

K. H. Chew

Discret. Math., 1999

1997

An extension of Vizing's theorem.

K. H. Chew

J. Graph Theory, 1997

On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs.

K. H. Chew

Discret. Math., 1997

1996

Total chromatic number of regular graphs of odd order and high degree.

K. H. Chew

Discret. Math., 1996

The chromatic index of graphs of high maximum degree.

K. H. Chew

Discret. Math., 1996

1992

Total chromatic number of complete <i>r</i>-partite graphs.

K. H. Chew, H. P. Yap

J. Graph Theory, 1992