RAIRO-Theor. Inf. Appl.
Volume 39, Number 1, January-March 2005Imre Simon, the tropical computer scientist
|Page(s)||145 - 160|
|Published online||15 March 2005|
The perfection and recognition of bull-reducible Berge graphs
2 Universidade Federal do Rio de Janeiro, Brasil; email@example.com, firstname.lastname@example.org
3 McGill University, Canada; email@example.com
The recently announced Strong Perfect Graph Theorem states that the class of perfect graphs coincides with the class of graphs containing no induced odd cycle of length at least 5 or the complement of such a cycle. A graph in this second class is called Berge. A bull is a graph with five vertices x, a, b, c, d and five edges xa, xb, ab, ad, bc. A graph is bull-reducible if no vertex is in two bulls. In this paper we give a simple proof that every bull-reducible Berge graph is perfect. Although this result follows directly from the Strong Perfect Graph Theorem, our proof leads to a recognition algorithm for this new class of perfect graphs whose complexity, O(n6), is much lower than that announced for perfect graphs.
Mathematics Subject Classification: 05C17 / 05C75 / 05C85
© EDP Sciences, 2005
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.