Eslahchi, Ch.; Hajiabolhassan, H.; Mehrabadi, M. L.; Tusserkani, R. A counterexample for Hilton-Johnson’s conjecture on list-coloring of graphs. (English) Zbl 0914.05026 Australas. J. Comb. 18, 127-131 (1998). A. J. W. Hilton and P. D. Johnson conjectured that the Hall index of every graph is at most 3. The authors of the present paper show that for every integer \(k\) there exists a graph whose Hall index is greater than \(k\). Reviewer: J.Fiamčik (Prešov) Cited in 1 Document MSC: 05C15 Coloring of graphs and hypergraphs Keywords:list colouring; Hall number; line graph; Hall index PDFBibTeX XMLCite \textit{Ch. Eslahchi} et al., Australas. J. Comb. 18, 127--131 (1998; Zbl 0914.05026)