Hian Poh Yap

According to our database, Hian Poh Yap authored at least 17 papers between 1977 and 2005.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2005

Chromatic Index Critical Graphs of Even Order with Five Major Vertices.

Zi-Xia Song, H. P. Yap

Graphs Comb., 2005

2000

Edge colorings of <i>K_2n</i> with a prescribed condition - I.

Qi Zhang Liu, H. P. Yap

Discret. Math., 2000

1999

Proof of a conjecture of Alan Hartman.

Qi Zhang Liu, H. P. Yap

J. Graph Theory, 1999

Edge Colouring of K2n with Spanning Star-Forests Receiving Distinct Colours.

H. P. Yap, Qi Zhang Liu

Graphs Comb., 1999

1995

Generalization of two results of Hilton on total-colourings of a graph.

H. P. Yap

Discret. Math., 1995

1992

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

K. H. Chew, H. P. Yap

J. Graph Theory, 1992

1990

Packing two graphs of order<i>n</i> having total size at most 2<i>n</i> - 2.

S. K. Teo, H. P. Yap

Graphs Comb., 1990

Corrigendum to: on graphs critical with respect to edge-colourings.

H. P. Yap

Discret. Math., 1990

1988

Packing of graphs - a survey.

H. P. Yap

Discret. Math., 1988

1987

Two Theorems on Packings of Graphs.

S. K. Teo, H. P. Yap

Eur. J. Comb., 1987

1985

Packing a tree with a graph of the same size.

Peter J. Slater, S. K. Teo, H. P. Yap

J. Graph Theory, 1985

1983

Chromatic index critical graphs of order 9.

Amanda G. Chetwynd, H. P. Yap

Discret. Math., 1983

1981

A construction of chromatic index critical graphs.

Hian Poh Yap

J. Graph Theory, 1981

On graphs critical with respect to edge-colourings.

Hian Poh Yap

Discret. Math., 1981

On graphs whose maximal subgraphs have at most two orbits.

Hian Poh Yap

Discret. Math., 1981

1980

On the critical graph conjecture.

Hian Poh Yap

J. Graph Theory, 1980

1977

Some remarks on E-minimal graphs.

H. P. Yap

Discret. Math., 1977