Optimizing Bull-Free Perfect Graphs

Authors:
Celina M. H. de Figueiredo;Frédéric Maffray
Affiliations:
-;-
Venue:
SIAM Journal on Discrete Mathematics
Year:
2005

Citing 0
Cited 4

Transitive orientations in bull-reducible Berge graphs

Discrete Applied Mathematics
Combinatorial optimization with 2-joins

Journal of Combinatorial Theory Series B
The structure of bull-free graphs I-Three-edge-paths with centers and anticenters

Journal of Combinatorial Theory Series B
Elimination graphs

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A bull is a graph with five vertices a,b,c,d,e and five edges ab, ac, bc, da, eb. Here we present polynomial-time combinatorial algorithms for the optimal weighted coloring and weighted clique problems in bull-free perfect graphs. The algorithms are based on a structural analysis and decomposition of bull-free perfect graphs.