We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Characterization of graphs with Hall number 2.

Eslachi, C. and Johnson, M. (2004) 'Characterization of graphs with Hall number 2.', Journal of graph theory., 45 (2). pp. 81-100.


Hall's condition is a simple requirement that a graph G and list assignment L must satisfy if G is to have a proper L-colouring. The Hall number of G is the smallest integer m such that whenever the lists on the vertices each has size at least m and Hall's condition is satisfied a proper L-colouring exists. Hilton and P.D. Johnson introduced the parameter and showed that a graph has Hall number 1 if and only if every block is a clique. In this paper we give a forbidden-induced-subgraph characterization of graphs with Hall number 2.

Item Type:Article
Keywords:List coloring, Hall number, Choice number, Chromatic number.
Full text:Full text not available from this repository.
Publisher Web site:
Record Created:07 Oct 2008
Last Modified:08 Apr 2009 16:36

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Look up in GoogleScholar | Find in a UK Library