Loading...

Characterization of M3(2)-graphs

Akbari, S ; Sharif University of Technology | 2013

285 Viewed
  1. Type of Document: Article
  2. Publisher: Charles Babbage Research Centre , 2013
  3. Abstract:
  4. A graph G is called an Mr(k)-graph if G has no k-list assignment to its vertices with exactly r vertex colorings. We characterize all A 3(2)-graphs. More precisely, it is shown that a connected graph G is an A3(2)-graph if and only if each block of G is a complete graph with at least three vertices
  5. Keywords:
  6. List coloring
  7. Source: Ars Combinatoria ; Volume 111 , 2013 , Pages 505-513 ; 03817032 (ISSN)