2017•Unpublished venueRequires access

• TOTAL COLORING OF STAR, WHEEL AND HELM GRAPH FAMILY

R. Arundhadhi, V. Ilayarani

Abstract

A total coloring of a graph G is an assignment of colors to both the vertices and edges of G such that adjacent or incident elements of G are not colored with the same color. The total chromatic number of a graph G is a smallest positive integer for which G admits a total coloring. In this paper, we obtain the total chromatic number of Star, Wheel and helm graph.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Combinatorics, Total coloring, Edge coloring, Mathematics, Fractional coloring, Graph power, Graph, List coloring