Skip to main content Accesibility Help
×
×
Home

Split Graphs Having Dilworth Number Two

  • Stephane Foldes (a1) and Peter L. Hammer (a1)
Abstract

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

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Split Graphs Having Dilworth Number Two
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Split Graphs Having Dilworth Number Two
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Split Graphs Having Dilworth Number Two
      Available formats
      ×
Copyright
References
Hide All
1. Berge, C., Graphes et hypergraphes (Dunod, Paris, 1970).
2. V., Chvâtal and Hammer, P. L., Set-packing problems and threshold graphs, University of Waterloo, CORR 73–21, August 1973.
3. Dilworth, R. P., A decomposition theorem for partially ordered sets, Ann. of Math. 51 (1950), 161166.
4 Foldes, S. and Hammer, P. L., Split graphs, University of Waterloo, CORR 76-3, March 1976.
5. Foldes, S. and Hammer, P. L. On a class of matroid-producing graphs, University of Waterloo, CORR 76-6, March 1976.
6. Foldes, S. and Hammer, P. L. The Dilworth number of a graph, University of Waterloo, CORR 76-20, May 1976.
7. Gilmore, P. C. and Hoffman, A. J., A characterization of comparability graphs and of interval graphs, Can. J. Math. 16 (1964), 539548.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Canadian Journal of Mathematics
  • ISSN: 0008-414X
  • EISSN: 1496-4279
  • URL: /core/journals/canadian-journal-of-mathematics
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed