Mathematics of Operations Research
On diameters and radii of bridged graphs
Discrete Mathematics
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Coloring precolored perfect graphs
Journal of Graph Theory
An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
Journal of the ACM (JACM)
Decomposition of balanced matrices
Journal of Combinatorial Theory Series B
Balanced 0, ±1 matrices I. decomposition
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series B
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Optimizing Bull-Free Perfect Graphs
SIAM Journal on Discrete Mathematics
Combinatorica
Graph Minors. XX. Wagner's conjecture
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Decomposing Berge graphs and detecting balanced skew partitions
Journal of Combinatorial Theory Series B
Even-hole-free graphs part I: Decomposition theorem
Journal of Graph Theory
Even-hole-free graphs part II: Recognition algorithm
Journal of Graph Theory
Journal of Graph Theory
Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
Journal of Combinatorial Theory Series B
A structure theorem for graphs with no cycle with a unique chord and its consequences
Journal of Graph Theory
A faster algorithm to recognize even-hole-free graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Decomposition of even-hole-free graphs with star cutsets and 2-joins
Journal of Combinatorial Theory Series B
Journal of Discrete Algorithms
Hi-index | 0.00 |
A 2-join is an edge cutset that naturally appears in decomposition of several classes of graphs closed under taking induced subgraphs, such as perfect graphs and claw-free graphs. In this paper we construct combinatorial polynomial time algorithms for finding a maximum weighted clique, a maximum weighted stable set and an optimal coloring for a class of perfect graphs decomposable by 2-joins: the class of perfect graphs that do not have a balanced skew partition, a 2-join in the complement, nor a homogeneous pair. The techniques we develop are general enough to be easily applied to finding a maximum weighted stable set for another class of graphs known to be decomposable by 2-joins, namely the class of even-hole-free graphs that do not have a star cutset. We also give a simple class of graphs decomposable by 2-joins into bipartite graphs and line graphs, and for which finding a maximum stable set is NP-hard. This shows that having holes all of the same parity gives essential properties for the use of 2-joins in computing stable sets.