H. R. Hind

According to our database, H. R. Hind authored at least 8 papers between 1989 and 2002.

Collaborative distances:

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

2002

Non-conformable subgraphs of non-conformable graphs.

Anthony J. W. Hilton, H. R. Hind

Discret. Math., 2002

1998

Strict majority functions on graphs.

Michael A. Henning, Hugh R. Hind

J. Graph Theory, 1998

1994

Recent developments in total colouring.

H. R. Hind

Discret. Math., 1994

1993

The total chromatic number of graphs having large maximum degree.

Anthony J. W. Hilton, H. R. Hind

Discret. Math., 1993

1992

An upper bound for the total chromatic number of dense graphs.

H. R. Hind

J. Graph Theory, 1992

1991

Graphs without large triangle free subgraphs.

Béla Bollobás, H. R. Hind

Discret. Math., 1991

1990

An upper bound for the total chromatic number.

H. R. Hind

Graphs Comb., 1990

1989

A new upper bound for the list chromatic number.

Béla Bollobás, H. R. Hind

Discret. Math., 1989