About Fall Colorings of Graphs

TL;DR

This paper investigates fall colorings of graphs, exploring their properties and relationships with other coloring types, and addresses open questions in the field.

Contribution

It provides new insights into fall colorings, clarifies their connections with other coloring concepts, and answers existing open questions.

Findings

Established relations between fall colorings and other coloring types

Answered open questions from previous research

Enhanced understanding of fall coloring properties

Abstract

A fall $k$-coloring of a graph $G$ is a proper $k$-coloring of $G$ such that each vertex of $G$ sees all $k$ colors on its closed neighborhood. In this paper, we answer some questions of \cite{dun} about some relations between fall colorings and some other types of graph colorings.