1. Hadwiger’s conjecture is true for almost every graph;Bollobás;Europ. J. Combin.,1980
2. On the maximum density of graphs which have no subtractions to ks;Fernandez de la Vega;Discrete Math.,1983
3. Contraction to K8;Jorgensen;J. Graph Theory,1994
4. The minimum Hadwiger number for graphs with a given mean degree of vertices;Kostochka;Metody Diskret. Anal.,1982
5. A lower bound for the product of the Hadwiger numbers of a graph and its complement;Kostochka;Comb. Anal.,1989