Corpus ID: 214612278

# A proof of the Total Coloring Conjecture

@article{Murthy2020APO,
title={A proof of the Total Coloring Conjecture},
author={T. Srinivasa Murthy},
journal={ArXiv},
year={2020},
volume={abs/2003.09658}
}
• T. Murthy
• Published 2020
• Mathematics, Computer Science
• ArXiv
A $total\ coloring$ of a graph G is a map $f:V(G) \cup E(G) \rightarrow \mathcal{K}$, where $\mathcal{K}$ is a set of colors, satisfying the following three conditions: 1. $f(u) \neq f(v)$ for any two adjacent vertices $u, v \in V(G)$; 2. $f(e) \neq f(e')$ for any two adjacent edges $e, e' \in E(G)$; and 3. $f(v) \neq f(e)$ for any vertex $v \in V(G)$ and any edge $e \in E(G)$ that is incident to same vertex $v$. The $total\ chromatic\ number$, $\chi''(G)$, is the minimum number of colors… Expand
5 Citations
Compositions, decompositions, and conformability for total coloring on power of cycle graphs
• Alesom Zorzi, Celina M. H. de Figueiredo, Raphael C. S. Machado, Uéverton S. Souza
• Mathematics
• 2021
Abstract Power of cycle graphs C n k have been extensively studied with respect to coloring problems, being both the vertex and the edge-coloring problems already solved in the class. The totalExpand
Hadwiger number always upper bound the chromatic number
In a simple graph G, we prove that Hadwiger number, h(G), of the given graph G always upper bound the chromatic number, χ(G), of the given graph G, that is, χ(G) ≤ h(G). This simply stated problem isExpand
Total Coloring and Total Matching: Polyhedra and Facets
• Computer Science, Mathematics
• ArXiv
• 2021
This paper proposes Integer Linear Programming models for both the Total Coloring and the Total Matching problems, and studies the strength of the corresponding Linear Programming relaxations. Expand
Coloring linear hypergraphs: the Erdős–Faber–Lovász conjecture and the Combinatorial Nullstellensatz
• Mathematics
• 2020
The long-standing Erdős-Faber-Lovasz conjecture states that every $n$-uniform linear hypergaph with $n$ edges has a proper vertex-coloring using $n$ colors. In this paper we propose an algebraicExpand
On (p, 1)-Total Labelling of NIC-Planar Graphs
• Bei Niu, Sanyang Liu
• Mathematics
• 2021
A graph is NIC-planar if it can be drawn in the plane so that there is at most one crossing per edge and two pairs of crossing edges share at most one common end vertex. A (p, 1)-total k-labelling ofExpand