par Fiorini, Samuel 
;Joret, Gwenaël
Référence European journal of combinatorics, 30, page (425-428)
Publication Publié, 2009
;Joret, Gwenaël Référence European journal of combinatorics, 30, page (425-428)
Publication Publié, 2009
Article révisé par les pairs
| Résumé : | Sewell and Trotter proved that every connected α-critical graph that is not isomorphic to K1, K2 or an odd cycle contains a totally odd K4-subdivision. Their theorem implies an interesting min-max relation for stable sets in graphs without totally odd K4-subdivisions. In this note, we give a simpler proof of Sewell and Trotter's theorem. © 2008 Dr Gwenael Joret. |
