Total Coloring and Total Coloring of Thorny Graphs
Zeynep Örs Yorgancıoğlu, Pınar Erbay Dündar
Abstract
Zeynep Örs Yorgancıoğlu, Pınar Erbay Dündar
Abstract
Over the 150 years various works have been done on the coloring of graphs such as vertex coloring, edge coloring. The last 40 years total coloring of the graphs has been considered by various authors. In this paper we give the total chromatic number of the thorny graphs and some theorems about total chromatic number of thorny 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.
Over the 150 years various works have been done on the coloring of graphs such as vertex coloring, edge coloring. The last 40 years total coloring of the graphs has been considered by various authors. In this paper we give the total chromatic number of the thorny graphs and some theorems about total chromatic number of thorny graphs.
Key concepts: Total coloring, Brooks' theorem, Complete coloring, Edge coloring, Greedy coloring, Fractional coloring, Combinatorics, Graph coloring