Skip to main content
SpringerLink
Log in

Three-regular path pairable graphs

  • Original Papers
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A graphG with at least 2k vertices isk-path pairable if for anyk pairs of distinct vertices ofG there arek edge disjoint paths between the pairs. It will be shown for any positive integerk that there is ak-path pairable graph of maximum degree three.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bollobás B. Random Graphs, Academic Press, London, 1985.

    Google Scholar 

  2. Csaba L., Faudree R.J., Gyárfás A., Lehel J. and Schelp R.H.: Networks communicating for each pairing of terminals, manuscript.

  3. Chartrand G. and Lesniak L. Graphs and Digraphs, 2nd edition, Wadsworth and Brooks/Cole, Belmont, 1986.

    Google Scholar 

  4. Chung F.R.K.: On concentrators, superconcentrators, generalizers, and nonblocking networks, Bell Sys. Tech. J.58, 1765–1777 (1978)

    Google Scholar 

  5. Faudree R.J., Gyárfás A. and Lehel J.: Minimal path pairable graphs, manuscript

  6. Jung M.A.: Eine Verallgemeinerung desn-fachen Zusammenhangs fúr Graphen, Math. Ann.187, 95–103 (1970)

    Google Scholar 

  7. Huck A.: A sufficient condition for graphs to be weaklyk-linked, manuscript

  8. Larman D.G. and Mani P.: On the existence of certain configurations within graphs and the 1-skeletons of polytopes, Proc. Lond. Math. Soc.20, 144–160 (1970)

    Google Scholar 

  9. Petersen J.: Die Theorie der regulären Graphs, Acta Math.15, 193–220 (1891)

    Google Scholar 

  10. Pippenger N.: Superconcentrators, SIAM J. Comput.,6, 298–304 (1977)

    Google Scholar 

  11. Valiant L.G.: Parallelism in comparison problems, SIAM J. Comput.,4, 348–355 (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Memphis State University, 38152, Memphis, TN, USA

    Ralph J. Faudree

  2. Computer and Automation Institute Hungarian Academy of Sciences, P.O.B. 63, H-1518, Budapest, Hungary

    András Gyárfás & Jenö Lehel

Authors
  1. Ralph J. Faudree
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. András Gyárfás
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jenö Lehel
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research is partially supported by ONR research grant N000014-88-K-0070 and NAS Exchange grant.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Faudree, R.J., Gyárfás, A. & Lehel, J. Three-regular path pairable graphs. Graphs and Combinatorics 8, 45–52 (1992). https://doi.org/10.1007/BF01271707

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation