Can I read Transitive orientations in bull-reducible Berge graphs on EtoBox?
Transitive orientations in bull-reducible Berge graphs by Celina de Figueiredo; Frédéric Maffray; Cláudia Villela Maciel is a Computer Science article available to read on EtoBox.
What is Transitive orientations in bull-reducible Berge graphs about?
A bull is a graph with five vertices r, y, x, z, s and five edges ry, yx, yz, xz, zs. A graph G is bull-reducible if every vertex of G lies in at most one bull of G. We prove that every bullreducible Berge graph G 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 graph exactly.
Who reads Transitive orientations in bull-reducible Berge graphs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Celina de Figueiredo; Frédéric Maffray; Cláudia Villela Maciel
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0166-218X)
- Published
- 2011
- Language
- EN
- Field
- Computer Science (Physical Sciences)