Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Graphs with 1-Factors

David P. Sumner
Proceedings of the American Mathematical Society
Vol. 42, No. 1 (Jan., 1974), pp. 8-12
DOI: 10.2307/2039666
Stable URL: http://www.jstor.org/stable/2039666
Page Count: 5
  • Read Online (Free)
  • Download ($30.00)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Graphs with 1-Factors
Preview not available

Abstract

In this paper it is shown that if G is a connected graph of order $2n(n > 1)$ not containing a 1-factor, then for each $k, 1 < k \leqq n$, there exists an induced; connected subgraph of order 2k which also fails to possess a 1-factor. Several other sufficient conditions for a graph to contain a 1-factor are presented. In particular, it is seen that the connected even order line graphs and total graphs always contain a 1-factor.

Page Thumbnails

  • Thumbnail: Page 
8
    8
  • Thumbnail: Page 
9
    9
  • Thumbnail: Page 
10
    10
  • Thumbnail: Page 
11
    11
  • Thumbnail: Page 
12
    12