Iosr Journals, S. K. Vaidya, Rakhimol V. Isaac
Abstract
A total coloring of a graph G is a proper coloring with additional property that no two adjacent or incident graph elements receive the same color. The total chromatic number of a graph G is the smallest positive integer for which G admits a total coloring. Here, we investigate the total chromatic number of some cycle related graphs.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A total coloring of a graph G is a proper coloring with additional property that no two adjacent or incident graph elements receive the same color. The total chromatic number of a graph G is the smallest positive integer for which G admits a total coloring. Here, we investigate the total chromatic number of some cycle related graphs.
Key concepts: Total coloring, Combinatorics, Brooks' theorem, Graph coloring, Edge coloring, Mathematics, Complete coloring, Fractional coloring