1 problem

Let $G$ be a 3-edge-connected nontrivial reduced graph, and let $F(G)$ denote its $F$-value. Let $P$ denote the Petersen graph. Catlin's conjecture. If $F(G)=3$, then $G$ must be…