Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable Mostafa BlidiaKonrad Engel Original Papers Pages: 103 - 108
Total colorings of graphs of order 2n having maximum degree 2n−2 Bor-Liang ChenHung-Lin Fu Original Papers Pages: 119 - 123
The cut cone III: On the role of triangle facets Michel DezaMonique LaurentSvatopluk Poljak Original Papers Pages: 125 - 142
Nearly triply regular Drad’s ofRH type Noboru ItoBlessilda P. Raposa Original Papers Pages: 143 - 153
On inverse problems for the cycle graph operator Bang Van LeErich Prisner Original Papers Pages: 155 - 164
Large regular graphs with no induced 2K 2 Madeleine PaoliG. W. PeckDouglas B. West Original Papers Pages: 165 - 197
Asymptotic solution of the Turán problem for some hypergraphs Alexander Sidorenko Research Problems Pages: 199 - 201