# Discrete Applied Mathematics

Discrete Applied Mathematics > 1997 > 77 > 2 > 185-200

Discrete Applied Mathematics > 1997 > 78 > 1-3 > 117-132

Discrete Applied Mathematics > 1999 > 95 > 1-3 > 163-167

_{1}

_{,}

_{4},P

_{5})-free graph which has no simplicial vertex is bounded by 3. This generalizes the case of (claw, P

_{5})-free graphs and leads to a very simple polynomial-time algorithm for determining the stability number of (claw, P

_{5})-free graphs and, more generally, of (4-pan,chair, K

_{1}...

Discrete Applied Mathematics > 2000 > 99 > 1-3 > 229-244

Discrete Applied Mathematics > 2000 > 102 > 3 > 223-243

Discrete Applied Mathematics > 2001 > 114 > 1-3 > 3-7

Discrete Applied Mathematics > 2005 > 146 > 1 > 74-80

Discrete Applied Mathematics > 2007 > 155 > 14 > 1846-1857

Discrete Applied Mathematics > 2008 > 156 > 13 > 2517-2529

Discrete Applied Mathematics > 2011 > 159 > 7 > 521-531

Discrete Applied Mathematics > 2012 > 160 > 6 > 834-865

Discrete Applied Mathematics > 2012 > 160 > 6 > 734-743

Discrete Applied Mathematics > 2012 > 160 > 12 > 1791-1797

Discrete Applied Mathematics > 2013 > 161 > 1-2 > 140-150

Discrete Applied Mathematics > 2014 > 163 > Part 2 > 142-154

Discrete Applied Mathematics > 2015 > 182 > Complete > 2-14

Discrete Applied Mathematics > 2016 > 199 > Complete > 37-45

Discrete Applied Mathematics > 2016 > 203 > C > 117-126

Discrete Applied Mathematics > 2017 > 216 > P1 > 273-280

Discrete Applied Mathematics > 2017 > 219 > C > 158-166