Split Graphs Having Dilworth Number Two
Stéphane Foldes, Peter L. Hammer · Canadian Journal of Mathematics · 1977
All graphs considered in this paper are finite, undirected, loopless and without multiple edges. The vertex set and the edge set of a graph G will be denoted by V(G) and E(G)y respectively. Thus we have