Four-Cycle Systems with Two-Regular Leaves | Graphs and Combinatorics Skip to main content
Springer Nature Link
Log in

Four-Cycle Systems with Two-Regular Leaves

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 In this paper we settle the existence problem for 4-cycle systems of K n −E(F) and of 2K n −E(F) for all 2-regular subgraphs F.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, National Chiao Tung University, Hsin Chu, Taiwan, Republic of China, , , , , , CN

    H.L. Fu

  2. Department of Discrete and Statistical Sciences, 120 Math Annex, Auburn University, AL 36849-5307, USA, , , , , , US

    C.A. Rodger

Authors
  1. H.L. Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C.A. Rodger
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: February 5, 1999¶Final version received: October 25, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fu, H., Rodger, C. Four-Cycle Systems with Two-Regular Leaves. Graphs Comb 17, 457–461 (2001). https://doi.org/10.1007/PL00013411

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00013411

Keywords

Search

Navigation