Stability number of bull- and chair-free graphs

0.00 Avg rating—0 Votes

Article ID:	iaor19931478
Country:	Netherlands
Volume:	41
Issue:	2
Start Page Number:	121
End Page Number:	129
Publication Date:	Jan 1993
Journal:	Discrete Applied Mathematics
Authors:	Sassano Antonio, Simone Caterina de
Keywords:	computational analysis

Abstract:

A bull is the graph with vertices a,b,c,d,e and edges ab,ac,bc,ad,be; a chair is the graph with vertices a,b,c,d,e and edges ab,bc,cd,be. The authors prove the stability number of bull-free chair-free graphs can be found in polynomial time.

Reviews

Required fields are marked *. Your email address will not be published.