On diameters and radii of bridged graphs
Discrete Mathematics
Discrete Mathematics
Discrete Applied Mathematics
Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs
Information Processing Letters
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
Finding augmenting chains in extensions of claw-free graphs
Information Processing Letters
An augmenting graph approach to the stable set problem in P5-free graphs
Discrete Applied Mathematics
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
Independent sets in extensions of 2K2-free graphs
Discrete Applied Mathematics
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Stable sets in k-colorable P5-free graphs
Information Processing Letters
MAX-CUT and containment relations in graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Practical computation of optimal schedules in multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Note: max-cut and containment relations in graphs
Theoretical Computer Science
Linear time algorithm for computing a small biclique in graphs without long induced paths
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.93 |
The class of P"5-free graphs is the unique minimal class defined by a single connected forbidden induced subgraph for which the complexity status of the maximum independent set problem is unknown. In this paper, we prove polynomial-time solvability of the problem in two subclasses of P"5-free graphs generalizing several previously known results.