Department of Mathematics, Karunya University, Coimbatore-641114, INDIA
Mathematics subject classification 2010: 05C15
A long-standing conjecture due to Erdos [2] states that the complete graphs are the only double-critical graphs, which is referred as the double-critical graph conjecture. In this paper, we prove the double-critical graph conjecture for k > 5.
Complete graph, Degree, Chromatic number, Vertex critical, Double-critical graph
