1 paper
Hao Huang, Alexander Yu
A connected n-chromatic graph G is double-critical if for all the edges xy of G, the graph G−x−y is (n−2)-chromatic. In 1966, Erd\H os and Lovász conjectured that the o…