Skip to main content
SpringerLink
Log in

The heterochromatic cycles in edge-colored graphs

  • Published:
Journal of Applied Mathematics and Computing Aims and scope Submit manuscript

Abstract

Given a graph and an edge coloring C of G, a heterochromatic cycle of G is a cycle in which any pair of edges have distinct colors. Let d c(v), named the color degree of a vertex v, be the maximum number of distinct colored edges incident with v. In this paper, we give several sufficient conditions for the existence of heterochromatic cycles in edge-colored graphs.

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. Albert, M., Frieze, A., Reed, B.: Multicolored Hamilton cycles. Electron. J. Comb. 2, R10 (1995)

    Google Scholar 

  2. Bondy, J.A., Murty, U.S.R.: Graph Theory with Application. Macmillan, New York (1976)

    Google Scholar 

  3. Broersma, H.J., Li, X., Woegingerr, G., Zhang, S.: Paths and cycles in colored graphs. Austr. J. Comb. 31, 297–305 (2005)

    Google Scholar 

  4. Erdös, P., Nestril, J., Rödl, V.: Some problems related to partitions of edges of graphs. In: Graphs and Other Combinatorial Topics, pp. 54–63. Teubner, Leipzig (1983)

    Google Scholar 

  5. Frieze, A.M., Reed, B.A.: Polochromatic Hamilton cycles. Discrete Math. 118, 69–74 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hahn, G., Thomassen, C.: Path and cycle sub-Ramsey numbers and edge coloring conjecture. Discrete Math. 62(1), 29–33 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hu, L., Li, X.: sufficient conditions for the existence of perfect heterochromatic matchings in colored graphs, arXiv:math.Co/051160v1, 24 Nov. 2005

  8. Li, H., Li, X., Liu, G., Wang, G.: The heterochromatic matchings in edge-colored bipartite graphs. Ars Comb. (2008, to appear)

  9. Li, H., Wang, G.: Color degree and heterochromatic cycles in edge-colored graphs. Rapport de Recherhe, 1460, LRI, CNRS-Univercité de Paris-Sud, France (2006)

  10. Li, H., Wang, G.: Color degree and heterochromatic matchings in edge-colored bipartite graphs. Util. Math. (2008, to appear)

  11. Li, H., Wang, G.: Color neighborhood and heterochromatic matchings in edge-colored bipartite graphs. RR.L.R.I No. 1443 (2006)

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, Shandong University, Jinan, 250100, People’s Republic of China

    Dongxiao Yu, Guizhen Liu & Shuo Li

Authors
  1. Dongxiao Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guizhen Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shuo Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guizhen Liu.

Additional information

This work is supported by a research grant NSFC (60673047).

The work of S. Li is supported by Changji University fund under grant number: 2008YJYB009.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yu, D., Liu, G. & Li, S. The heterochromatic cycles in edge-colored graphs. J. Appl. Math. Comput. 30, 171–179 (2009). https://doi.org/10.1007/s12190-008-0164-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12190-008-0164-y

Keywords

Mathematics Subject Classification (2000)

Search

Navigation