>
Fa   |   Ar   |   En
   A NOTE ON FALL COLORINGS OF KNESER GRAPHS  
   
نویسنده shaebani saeed
منبع transactions on combinatorics - 2019 - دوره : 8 - شماره : 3 - صفحه:13 -15
چکیده    T. a fall coloring of a graph g is a proper coloring of g with k colors such that each vertex sees all k colors on its closed neighborhood. in this paper, we characterize all fall colorings of kneser graphs of type kg(n, 2).
کلیدواژه : Kneser graph ,fall coloring ,b-coloring
آدرس damghan university, school of mathematics and computer science, Iran
پست الکترونیکی shaebani@du.ac.ir
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved