Du, Ding-ZhuNgo, Hung Q.2020-09-022020-09-022000-10-20https://hdl.handle.net/11299/215442Consider n disjoint triangles and a cycle on the 3n vertices of the n triangles. In 1986, Du, Hsu, and Hwang conjectured that the union of the n triangles and the cycle has independent number n. Soon later, Paul Erdös improved it to a stronger version that every cycle-plus-triangle graph is 3-colorable. This conjecture was proven by H. Fleischner and M. Stiebitz. In this note, we want to give an extension of the above conjecture with an application in switching networks.en-USReport