论文信息 - Split Graphs Having Dilworth Number Two

Split Graphs Having Dilworth Number Two

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

P. Hammer | S. Foldes

[1] R. P. Dilworth,et al. A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .

[2] P. Gilmore,et al. A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

[3] P. Hammer,et al. The Dilworth Number of a Graph , 1978 .