Geodesic
Split Graphs Having Dilworth Number Two
Canadian journal of mathematics, Tome 29 (1977) no. 3, pp. 666-672

Voir la notice de l'article provenant de la source Cambridge University Press

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 
Foldes, Stephane; Hammer, Peter L. Split Graphs Having Dilworth Number Two. Canadian journal of mathematics, Tome 29 (1977) no. 3, pp. 666-672. doi: 10.4153/CJM-1977-069-1
@article{10_4153_CJM_1977_069_1,
     author = {Foldes, Stephane and Hammer, Peter L.},
     title = {Split {Graphs} {Having} {Dilworth} {Number} {Two}},
     journal = {Canadian journal of mathematics},
     pages = {666--672},
     year = {1977},
     volume = {29},
     number = {3},
     doi = {10.4153/CJM-1977-069-1},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1977-069-1/}
}
TY  - JOUR
AU  - Foldes, Stephane
AU  - Hammer, Peter L.
TI  - Split Graphs Having Dilworth Number Two
JO  - Canadian journal of mathematics
PY  - 1977
SP  - 666
EP  - 672
VL  - 29
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1977-069-1/
DO  - 10.4153/CJM-1977-069-1
ID  - 10_4153_CJM_1977_069_1
ER  - 
%0 Journal Article
%A Foldes, Stephane
%A Hammer, Peter L.
%T Split Graphs Having Dilworth Number Two
%J Canadian journal of mathematics
%D 1977
%P 666-672
%V 29
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1977-069-1/
%R 10.4153/CJM-1977-069-1
%F 10_4153_CJM_1977_069_1

[1] 1. Berge, C., Graphes et hypergraphes (Dunod, Paris, 1970). Google Scholar

[2] 2. V., Chvâtal and Hammer, P. L., Set-packing problems and threshold graphs, University of Waterloo, CORR 73–21, August 1973. Google Scholar

[3] 3. Dilworth, R. P., A decomposition theorem for partially ordered sets, Ann. of Math. 51 (1950), 161–166. Google Scholar

[4] 4 Foldes, S. and Hammer, P. L., Split graphs, University of Waterloo, CORR 76-3, March 1976. Google Scholar

[5] 5. Foldes, S. and Hammer, P. L. On a class of matroid-producing graphs, University of Waterloo, CORR 76-6, March 1976. Google Scholar

[6] 6. Foldes, S. and Hammer, P. L. The Dilworth number of a graph, University of Waterloo, CORR 76-20, May 1976. Google Scholar

[7] 7. Gilmore, P. C. and Hoffman, A. J., A characterization of comparability graphs and of interval graphs, Can. J. Math. 16 (1964), 539–548. Google Scholar

Cité par Sources :