Skip to main content
Springer Nature Link
Log in

On Edge-Colored Graphs Covered by Properly Colored Cycles

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We characterize edge-colored graphs in which every edge belongs to some properly colored cycle. We obtain our result by applying a characterization of 1-extendable graphs.

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
$34.99 /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 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. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms, Applications. Springer Monographs in Mathematics. Springer, London, 2001

  2. Diestel, R.: Graph Theory, volume 173 of Graduate Texts in Mathematics. Springer, New York, 2nd edition, 2000

  3. Grossman, J.W., Häggkvist, R.: Alternating cycles in edge-partitioned graphs. J. Combin. Theory Ser. B 34(1), 77–81 (1983)

    Google Scholar 

  4. Little, C.H.C., Grant, D.D., Holton, D.A.: On defect-d matchings in graphs. Discrete Math. 13(1), 41–54 (1975)

    Google Scholar 

  5. Lovász, L., Plummer, M.D.: Matching Theory, volume 29 of Annals of Discrete Mathematics. North-Holland Publishing Co., Amsterdam, 1986

  6. Szeider, S.: Finding paths in graphs avoiding forbidden transitions. Discr. Appl. Math. 126(2–3), 239–251 (2003)

    Google Scholar 

  7. Szeider, S.: On theorems equivalent with Kotzig's result on graphs with unique 1-factors. Ars Combinatoria 73, 53–64 (2004)

    Google Scholar 

  8. Yeo, A.: A note on alternating cycles in edge-coloured graphs. J. Combin. Theory Ser. B 69(2), 222–225 (1997)

    Google Scholar 

  9. Yu, Q.L.: Characterizations of various matching extensions in graphs. Australas. J. Combin. 7, 55–64 (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Systems, Vienna University of Technology, A-1040, Vienna, Austria

    Herbert Fleischner

  2. Department of Computer Science, University of Durham, Durham, DH1 3LE, England, UK

    Stefan Szeider

Authors
  1. Herbert Fleischner
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Stefan Szeider
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Received: April, 2003

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fleischner, H., Szeider, S. On Edge-Colored Graphs Covered by Properly Colored Cycles. Graphs and Combinatorics 21, 301–306 (2005). https://doi.org/10.1007/s00373-005-0613-4

Download citation

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-005-0613-4

Keywords