Skip to main content
SpringerLink
Log in

Minimal colorings for properly colored subgraphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We give conditions on the minimum numberk of colors, sufficient for the existence of given types of properly edge-colored subgraphs in ak-edge-colored complete graph. The types of subgraphs we study include families of internally pairwise vertex-disjoint paths with common endpoints, hamiltonian paths and hamiltonian cycles, cycles with a given lower bound of their length, spanning trees, stars, and cliques. Throughout the paper, related conjectures are proposed.

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. Bánkfalvi, M., Bánkfalvi, Z.: Alternating hamiltonian circuits in 2-colored complete graphs, Theory of Graphs, Akadémiai Kiadó, Budapest 11–18 (1968)

    Google Scholar 

  2. Benkouar, A., Manoussakis, Y., Paschos, V., Saad, R.: On the complexity of some hamiltonian and eulerian problems in colored complete graphs, LNCS 557 (1991) 190–198 (Springer-Verlag), also to appear in RAIRO on Operations Research (1996)

    Google Scholar 

  3. Bialostocki, A., Dierker, P.: On simple hamiltonian cycles in a 2-colored complete graph. Ars Combinatoria32, 13–16 (1991)

    MATH  MathSciNet  Google Scholar 

  4. Bollobás, B., Erdös, P.: Alternating hamiltonian cycles. Israel J. Mathematics23, 126–130 (1976)

    Article  MATH  Google Scholar 

  5. Chen, C.C., Daykin, D.E.: Graphs with hamiltonian cycles having adjacent lines of different colors. J. Comb. Theory Ser. B21, 135–139 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  6. Chou, W.S., Manoussakis, Y., Megalakaki, O., Spyratos, M., Tuza, Zs.: Paths through given vertices in edge-colored graphs, Mathématiques. Informatique et Sciences Humaines127(32, 49–58 (1994)

    MATH  MathSciNet  Google Scholar 

  7. Dirac, G.A.: Some Theorems on abstract graphs. Proc. London Math. Soc.2, 69–81 (1952)

    Article  MATH  MathSciNet  Google Scholar 

  8. Erdös, P., Gallai, T.: On maximal paths and circuits of graphs. Acta Math. Acad. Sc. Hungar.10, 337–346 (1959)

    Article  MATH  Google Scholar 

  9. Erdös, P., Simonovits, M., Sós, V.T.: Anti-Ramsey theorems. Colloq. Math. Soc. J. Bolyai 10 Keszthely (Hungary) 633–643 (1973)

    Google Scholar 

  10. Erdös, P., Stone, A.H.: On the structure of linear graphs. Bull. Amer. Math. Soc.52, 1087–1091 (1946)

    Article  MATH  MathSciNet  Google Scholar 

  11. Erdös, P., Tuza, Zs.: Rainbow subgraphs in edge-colorings of complete graphs. Annals of Discr. Math.55, 81–88 (1993)

    Article  Google Scholar 

  12. Hell, P., Manoussakis, Y., Tuza, Zs.: Packing problems in edge-colored graphs. Discr. Appl. Math.52, 295–306 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  13. Manoussakis, Y.: Alternating paths in colored complete graphs. Discr. Appl. Math.72, 247–260 (1994)

    MathSciNet  Google Scholar 

  14. Ore, O.: Arc coverings of graphs. Ann. Mat. Pura Appl.55, 315–321 (1961)

    Article  MATH  MathSciNet  Google Scholar 

  15. Pósa, L.: A theorem concerning Hamilton lines. Magyar Tud. Akad. Mat. Kutato Int. Közl7, 225–226 (1962)

    MATH  Google Scholar 

  16. Rödl, V., Tuza, Zs.: Rainbow subgraphs in properly edge-colored graphs. Random Structures and Algorithms3, 175–182 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  17. Seinsche, D.: On a property of the class ofn-colorable graphs. J. Comb. Theory Ser. B16, 191–193 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  18. Simonovits, M., Sós, V.T.: On restricted colourings ofK n. Combinatorica4(1, 101–110 (1984)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Paris-XI (Orsay), L.R.I., Bât. 490, F-91405, Orsay Cédex, France

    Y. Manoussakis

  2. Département d'Informatique, Université Paris-XII, 61, Avenue du Général de Gaulle, F-94010, Créteil Cédex, France

    M. Spyratos

  3. Computer and Automation Institute, Hungarian Academy of Sciences, Kende u. 13-17, H-1111, Budapest, Hungary

    Zs. Tuza

  4. Institut für Mathematik, Technische Universität Ilmenau, D-98684, Ilmenau, Germany

    M. Voigt

Authors
  1. Y. Manoussakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Spyratos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zs. Tuza
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Voigt
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported by a European Union PECO grant under identification number CIPA3510PL929589, while on leave at University Paris-XI

Rights and permissions

Reprints and permissions

About this article

Cite this article

Manoussakis, Y., Spyratos, M., Tuza, Z. et al. Minimal colorings for properly colored subgraphs. Graphs and Combinatorics 12, 345–360 (1996). https://doi.org/10.1007/BF01858468

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

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

Search

Navigation