Skip to main content
SpringerLink
Log in

Any four independent edges of a 4-connected graph are contained in a circuit

  • Published:
Acta Mathematica Hungarica Aims and scope Submit manuscript

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

References

  1. R. Häggkvist-C. Thomassen, Circuits through specified edges,Discrete Mathematics,41 (1982), 29–34.

    Article  Google Scholar 

  2. L. Lovász, Problem 5,Period. Math. Hung.,4 (1974), 82.

    Google Scholar 

  3. L. Lovász,Combinatorial problems and exercises, North-Holland (1979).

  4. L. Pyber, An Erdős-Gallai conjecture,Combinatorica,5 (1984), 67–80.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute of the Hungarian Academy of Sciences, Reáltanoda U. 13-15, H-1053, Budapest, Hungary

    Péter L. Erdős & E. Győri

Authors
  1. Péter L. Erdős
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Győri
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Erdős, P.L., Győri, E. Any four independent edges of a 4-connected graph are contained in a circuit. Acta Math Hung 46, 311–313 (1985). https://doi.org/10.1007/BF01955745

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation