Proof of `Graphs without a 3-connected subgraph are 4-colorable`
groundedproofs/Lax10Proofs/Main.lean · lax-10
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
The main 4-colorability corollary.