A new upper bound for the list chromatic number. - Béla Bollobás; H. R. Hind (Discret. Math., 1989)

An upper bound for the total chromatic number. - H. R. Hind (Graphs Comb., 1990)

Graphs without large triangle free subgraphs. - Béla Bollobás; H. R. Hind (Discret. Math., 1991)

An upper bound for the total chromatic number of dense graphs. - H. R. Hind (J. Graph Theory, 1992)

The total chromatic number of graphs having large maximum degree. - Anthony J. W. Hilton; H. R. Hind (Discret. Math., 1993)

Recent developments in total colouring. - H. R. Hind (Discret. Math., 1994)

Strict majority functions on graphs. - Michael A. Henning; Hugh R. Hind (J. Graph Theory, 1998)

Non-conformable subgraphs of non-conformable graphs. - Anthony J. W. Hilton; H. R. Hind (Discret. Math., 2002)