Skip to main content
×
Home
    • Aa
    • Aa
  • Access
  • Cited by 7
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    de Carvalho, Marcelo H. and Little, C. H. C. 2009. Circuit decompositions of join-covered graphs. Journal of Graph Theory, Vol. 62, Issue. 3, p. 220.


    Szigeti, Zoltán 2001. On Generalizations of Matching-covered Graphs. European Journal of Combinatorics, Vol. 22, Issue. 6, p. 865.


    1986. Matching Theory.


    Lovász, L. 1983. Ear-decompositions of matching-covered graphs. Combinatorica, Vol. 3, Issue. 1, p. 105.


    Plummer, M.D. 1980. On n-extendable graphs. Discrete Mathematics, Vol. 31, Issue. 2, p. 201.


    Lovász, L and Plummer, M.D 1977. On minimal elementary bipartite graphs. Journal of Combinatorial Theory, Series B, Vol. 23, Issue. 1, p. 127.


    Little, Charles H.C. Grant, Douglas D. and Holton, D.A. 1975. On defect-d matchings in graphs. Discrete Mathematics, Vol. 13, Issue. 1, p. 41.


    ×
  • Currently known as: Journal of the Australian Mathematical Society Title history
    Journal of the Australian Mathematical Society, Volume 18, Issue 4
  • December 1974, pp. 450-452

A theorem on connected graphs in which every edge belongs to a 1-factor

  • Charles H. C. Little (a1)
  • DOI: http://dx.doi.org/10.1017/S144678870002913X
  • Published online: 01 April 2009
Abstract

In this paper, we consider factor covered graphs, which are defined basically as connected graphs in which every edge belongs to a 1-factor. The main theorem is that for any two edges e and e′ of a factor covered graph, there is a cycle C passing through e and e′ such that the edge set of C is the symmetric difference of two 1-factors.

    • Send article to Kindle

      To send this article to your Kindle, first ensure coreplatform@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.

      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.

      A theorem on connected graphs in which every edge belongs to a 1-factor
      Your Kindle email address
      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 Dropbox account. Find out more about sending content to Dropbox.

      A theorem on connected graphs in which every edge belongs to a 1-factor
      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 Google Drive account. Find out more about sending content to Google Drive.

      A theorem on connected graphs in which every edge belongs to a 1-factor
      Available formats
      ×
Copyright
Recommend this journal

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

Journal of the Australian Mathematical Society
  • ISSN: 1446-7887
  • EISSN: 1446-8107
  • URL: /core/journals/journal-of-the-australian-mathematical-society
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax