A Remark on Triangle-Critical Graphs

MaRDI QIDQ6208524zbMATH OpenFDO

Authors Anders Sune Pedersen

Publication date 24 February 2008

Mathematics Subject Classification ID

Trees (05C05)

Abstract: A connected $k$-chromatic graph $G$ with $kgeq3$ is said to be triangle-critical, if every edge of $G$ is contained in an induced triangle of $G$ and the removal of any triangle from $G$ decreases the chromatic number of $G$ by three. B. Toft posed the problem of showing that the complete graphs on more than two vertices are the only triangle-critical graphs. By applying a method of M. Stiebitz [Discrete Math. 64 (1987), 91--93], we answer the problem affirmatively for triangle-critical $k$-chromatic graphs with $kleq6$.

This page was built for publication: A Remark on Triangle-Critical Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6208524)