Pages that link to "Item:Q1273432"
From MaRDI portal
The following pages link to Proof of Toft's conjecture: Every graph containing no fully odd \(K_4\) is 3-colorable (Q1273432):
Displaying 6 items.
- Bonds with parity constraints (Q414634) (← links)
- Odd-\(K_{4}\)'s in stability critical graphs (Q1045088) (← links)
- Crumby colorings -- red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen (Q2685314) (← links)
- \(K_4\)-free and \(\overline{C_6}\)-free planar matching covered graphs (Q2811192) (← links)
- Hadwiger’s Conjecture (Q2827298) (← links)
- Subdivisions with congruence constraints in digraphs of large chromatic number (Q6183432) (← links)