Abstract
A fall coloring of a graph G is a proper coloring of the vertex set of G such that every vertex of G is a color dominating vertex in G (that is, it has at least one neighbor in each of the other color classes). The fall coloring number f(G) of G is the minimum size of a fall color partition of G (when it exists). Trivially, for any graph G, (G) f(G). In this paper, we show the existence of an innite family of graphs G with prescribed values for (G) and f(G). We also obtain the smallest non-fall colorable graphs with a given minimum degree and determine their number. These answer two of the questions raised by Dunbar et al.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
