On a Theorem of Sewell and Trotter

Simple item page
dc.creatorFiorini, Samuel
dc.creatorJoret, Gwenaël
dc.date2007-12-23
dc.date2008-02-20
dc.date.accessioned2026-07-07T12:12:15Z
dc.date.available2026-07-07T12:12:15Z
dc.descriptionSewell and Trotter [J. Combin. Theory Ser. B, 1993] proved that every connected alpha-critical graph that is not isomorphic to K_1, K_2 or an odd cycle contains a totally odd K_4-subdivision. Their theorem implies an interesting min-max relation for stable sets in graphs without totally odd K_4-subdivisions. In this note, we give a simpler proof of Sewell and Trotter's theorem.
dc.descriptionReferee comments incorporated
dc.identifierhttps://arxiv.org/abs/0712.3956
dc.identifierhttp://arxiv.org/abs/0712.3956
dc.identifierEuropean Journal of Combinatorics, Vol. 30 (2), 2009, pp. 425-428
dc.identifierdoi:10.1016/j.ejc.2008.05.002
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/210482
dc.subjectCombinatorics
dc.subject05C69
dc.titleOn a Theorem of Sewell and Trotter
dc.typetext

Files

Collections

arXiv