Transitive orientations in bull-reducible graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2011

Transitive orientations in bull-reducible graphs

Résumé

A previous termbullnext term is a previous termgraphnext term with five vertices r,y,x,z,s and five edges ry, yx, yz, xz, zs. A previous termgraphnext termG is previous termbullnext term-previous termreduciblenext term if every vertex of G lies in at most one previous termbullnext term of G. We prove that every previous termbullnext term-previous termreduciblenext term Berge previous termgraphnext termG that contains no antihole is weakly chordal, or has a homogeneous set, or is transitively orientable. This yields a fast polynomial time algorithm to color the vertices of such a previous termgraphnext term exactly.

Dates et versions

hal-00574160 , version 1 (07-03-2011)

Identifiants

Citer

Celina de Figueiredo, Frédéric Maffray, C.R. Villela Maciel. Transitive orientations in bull-reducible graphs. Discrete Applied Mathematics, 2011, 159 (7), pp.561-573. ⟨10.1016/j.dam.2010.05.011⟩. ⟨hal-00574160⟩
43 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More