TIGHT JUST EXCELLENT GRAPHS
Irene Kulrekha Mudartha, R. Sundareswaran, V. Swaminathan · Akademik Açık Erişim (Işık Üniversitesi) · 2019
A graph G is -excellent if for every vertex v, there exists a chromatic partition such that fvg 2 .A graph G is just -excellent if every vertex appears as a singleton in exactly one -partition. In this paper, a special type of just -excellence namely tight just -excellence is de ned and studied.