Loading...
Send to Friend
 Bookmark
 Review List
  1. Characterization of graphs with Hall index 2
Characterization of graphs with Hall index 2
24 viewed

Characterization of graphs with Hall index 2

Eslahchi, C

Characterization of graphs with Hall index 2

Eslahchi, C ; Sharif University of Technology | 2000

24 Viewed
  1. Type of Document: Article
  2. Publisher: 2000
  3. Abstract:
  4. A proper edge coloring of a simple graph G from some lists assigned to the edges of G is of interest. A. Hilton and P. Johnson (1990) considered a necessary condition for the list coloring of a graph and called it Hall's condition. They introduced the Hall index of a graph G, h'(G), as the smallest positive integer m such that there exists a list coloring whenever the lists are of length at least m and Hall's condition is satisfied. They characterized all graphs G with h' (G) = 1. In this paper we characterize the graphs with Hall index 2
  5. Keywords:
  7. Source: Australasian Journal of Combinatorics ; Volume 21 , 2000 , Pages 13-21 ; 10344942 (ISSN)
  8. URL: https://ajc.maths.uq.edu.au/pdf/21/ocr-ajc-v21-p13.pdf