On domination problems for permutation and other graphs
Theoretical Computer Science
On diameters and radii of bridged graphs
Discrete Mathematics
A decomposition for a class of &parl0;P5,P5&parr0;- free graphs
Discrete Mathematics
Discrete Mathematics
Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs
Information Processing Letters
Proceedings of an international symposium on Graphs and combinatorics
On extendedP4-reducible and extendedP4-sparse graphs
Theoretical Computer Science
Weighted parameters in (P5,&Pmacr;5)-free graphs
Discrete Applied Mathematics
A note on &agr;-redundant vertices in graphs
Discrete Applied Mathematics
Discrete Mathematics
On the stable set problem in special P5-free graphs
Discrete Applied Mathematics
Independent domination in finitely defined classes of graphs
Theoretical Computer Science
Finding augmenting chains in extensions of claw-free graphs
Information Processing Letters
On variations of P4-sparse graphs
Discrete Applied Mathematics
An augmenting graph approach to the stable set problem in P5-free graphs
Discrete Applied Mathematics
On easy and hard hereditary classes of graphs with respect to the independent set problem
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
On the structure and stability number of P5- and co-chair-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
P5-free augmenting graphs and the maximum stable set problem
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Some results on maximum stable sets in certain P5-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Polynomial algorithm for finding the largest independent sets in graphs without forks
Discrete Applied Mathematics
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics
Independent domination in chordal graphs
Operations Research Letters
The Maximum Independent Set Problem in Planar Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
New applications of clique separator decomposition for the maximum weight stable set problem
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Maximum regular induced subgraphs in 2P3-free graphs
Theoretical Computer Science
Maximum weight independent sets in (P6,co-banner)-free graphs
Information Processing Letters
Hi-index | 0.05 |
The class of 2K"2-free graphs includes several interesting subclasses such as split, pseudo-split, threshold graphs, complements to chordal, interval or trivially perfect graphs. The fundamental property of 2K"2-free graphs is that they contain polynomially many maximal independent sets. As a consequence, several important problems that are NP-hard in general graphs, such as 3-colorability, maximum weight independent set (WIS), minimum weight independent dominating set (WID), become polynomial-time solvable when restricted to the class of 2K"2-free graphs. In the present paper, we extend 2K"2-free graphs to larger classes with polynomial-time solvable WIS or WID. In particular, we show that WIS can be solved in polynomial time for (K"2+K"1","3)-free graphs and WID for (K"2+K"1","2)-free graphs. The latter result is in contrast with the fact that independent domination is NP-hard in the class of 2K"1","2-free graphs, which has been recently proven by Zverovich.