A note on fall colorings of Kneser graphs

Document Type : Research Paper

Author

School of Mathematics and Computer Science, Damghan University, P.O. Box 36716-41167, Damghan, Iran

Abstract

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)$‎.

Keywords

Main Subjects

Transactions on Combinatorics
Volume 8, Issue 3 - Serial Number 3
September 2019
Pages 13-15

Files

History

  • Receive Date: 10 November 2018
  • Revise Date: 14 March 2019
  • Accept Date: 27 March 2019
  • Published Online: 01 September 2019

Share

How to cite

Statistics