×
Author ID: hind.h-r-f Recent zbMATH articles by "Hind, H. R. F."
Published as: Hind, H. R. F.; Hind, H. R.
Documents Indexed: 14 Publications since 1989
Co-Authors: 2 Co-Authors with 6 Joint Publications
75 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

13 Publications have been cited 27 times in 21 Documents Cited by Year
The total chromatic number of graphs having large maximum degree. Zbl 0785.05035
Hilton, A. J. W.; Hind, H. R.
20
1993
An upper bound for the total chromatic number. Zbl 0725.05043
Hind, H. R.
16
1990
Graphs without large triangle free subgraphs. Zbl 0767.05083
Bollobás, Béla; Hind, H. R.
14
1991
A new upper bound for the list chromatic number. Zbl 0674.05027
Bollobás, Béla; Hind, H. R.
11
1989
Menger-type results for three or more vertices. Zbl 0974.05047
Hind, H. R.; Oellermann, O.
10
1996
An upper bound for the total chromatic number of dense graphs. Zbl 0767.05048
Hind, H. R.
5
1992
Totally critical graphs and the conformability conjecture. Zbl 0943.05034
Hamilton, G. M.; Hilton, A. J. W.; Hind, H. R. F.
2
1999
Recent developments in total colouring. Zbl 0796.05038
Hind, H. R.
2
1994
Non-conformable subgraphs of non-conformable graphs. Zbl 1009.05057
Hilton, A. J. W.; Hind, H. R.
2
2002
Totally critical even order graphs. Zbl 0935.05043
Hamilton, G. M.; Hilton, A. J. W.; Hind, H. R. F.
1
1999
Updating the conformability conjecture. Zbl 0974.05031
Hamilton, G. M.; Hilton, A. J. W.; Hind, H. R. F.
1
1996
A sufficient condition for a graph to be class one. Zbl 0835.05028
Hind, H. R.
1
1994
Graphs of order at most 10 which are critical with respect to the total chromatic number. Zbl 0879.05026
Hamilton, G. M.; Hilton, A. J. W.; Hind, H. R. F.
1
1997
Non-conformable subgraphs of non-conformable graphs. Zbl 1009.05057
Hilton, A. J. W.; Hind, H. R.
2
2002
Totally critical graphs and the conformability conjecture. Zbl 0943.05034
Hamilton, G. M.; Hilton, A. J. W.; Hind, H. R. F.
2
1999
Totally critical even order graphs. Zbl 0935.05043
Hamilton, G. M.; Hilton, A. J. W.; Hind, H. R. F.
1
1999
Graphs of order at most 10 which are critical with respect to the total chromatic number. Zbl 0879.05026
Hamilton, G. M.; Hilton, A. J. W.; Hind, H. R. F.
1
1997
Menger-type results for three or more vertices. Zbl 0974.05047
Hind, H. R.; Oellermann, O.
10
1996
Updating the conformability conjecture. Zbl 0974.05031
Hamilton, G. M.; Hilton, A. J. W.; Hind, H. R. F.
1
1996
Recent developments in total colouring. Zbl 0796.05038
Hind, H. R.
2
1994
A sufficient condition for a graph to be class one. Zbl 0835.05028
Hind, H. R.
1
1994
The total chromatic number of graphs having large maximum degree. Zbl 0785.05035
Hilton, A. J. W.; Hind, H. R.
20
1993
An upper bound for the total chromatic number of dense graphs. Zbl 0767.05048
Hind, H. R.
5
1992
Graphs without large triangle free subgraphs. Zbl 0767.05083
Bollobás, Béla; Hind, H. R.
14
1991
An upper bound for the total chromatic number. Zbl 0725.05043
Hind, H. R.
16
1990
A new upper bound for the list chromatic number. Zbl 0674.05027
Bollobás, Béla; Hind, H. R.
11
1989

Citations by Year