Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-12T18:30:00.292Z Has data issue: false hasContentIssue false
  • English
  • Français

Split Graphs Having Dilworth Number Two

Published online by Cambridge University Press:  20 November 2018

Stephane Foldes and
Peter L. Hammer
Stephane Foldes
Affiliation:
University of Waterloo, Waterloo, Ontario
Peter L. Hammer
Affiliation:
University of Waterloo, Waterloo, Ontario
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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

Information

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 29 , Issue 3 , 01 June 1977, pp. 666 - 672
Copyright
Copyright © Canadian Mathematical Society 1977

References

1. Berge, C., Graphes et hypergraphes (Dunod, Paris, 1970).Google Scholar
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. Dilworth, R. P., A decomposition theorem for partially ordered sets, Ann. of Math. 51 (1950), 161–166.Google Scholar
4 Foldes, S. and Hammer, P. L., Split graphs, University of Waterloo, CORR 76-3, March 1976.Google Scholar
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. Foldes, S. and Hammer, P. L. The Dilworth number of a graph, University of Waterloo, CORR 76-20, May 1976.Google Scholar
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