 login/create account
login/create account
    list colouring
List Hadwiger Conjecture ★★
Author(s): Kawarabayashi; Mohar
Conjecture   Every  -minor-free graph is
-minor-free graph is  -list-colourable for some constant
-list-colourable for some constant  .
. 
 -minor-free graph is
-minor-free graph is  -list-colourable for some constant
-list-colourable for some constant  .
. Keywords: Hadwiger conjecture; list colouring; minors
 
   
           Drupal
 Drupal CSI of Charles University
 CSI of Charles University