2 problems

Let $G$ be a minimally 1-tough graph, meaning that $\tau(G)=1$ and $\tau(G-e)<1$ for every edge $e$ of $G$, where $\tau(G)$ is the toughness of $G$. Kriesell's conjecture. Every mi…

Norine–Thomas's conjecture. Every minimal brick $G$ has at least