Skip to main content
SpringerLink
Log in

Upper Bounds for the Automorphic Chromatic Index of a Graph

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

Abstract

The automorphic H-chromatic index of a graph Γ is the minimum integer m for which Γ has a proper edge-coloring with m colors preserved by a given subgroup H of the full automorphism group of Γ. We determine upper bounds for this index in terms of the chromatic index of Γ for some abelian 2-groups H.

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. Albertson, M.O., Collins, K.L.: Symmetry breaking in graphs. Electron. J. Comb. 3, #R18 (1996)

  2. Baumann U., Lesch M.: Transitive groups of partition preserving automorphisms of graphs with edge colourings. Wiss. Z. Tech. Hochsch. Ilmenau 34(2), 33–38 (1988)

    MATH  MathSciNet  Google Scholar 

  3. Baumann U., Lesch M., Schmeichel I.: Farb-und zerlegungstreue Automorphismen von Graphen. Math. Nachr. 134, 161–167 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  4. Baumann U., Lesch M., Schmeichel I.: Remarkable groups of graphs with edge colorings. Math. Nachr. 148, 175–182 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bondy, J.A., Murty, U.S.R.: Graph Theory, GTM 244. Springer, Berlin (2010)

  6. Chvatal V., Sichler J.: Chromatic automorphisms of graphs. J. Comb. Theory Ser. B 14, 209–215 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  7. Collins, K.L., Trenk, A.N.: The distinguishing chromatic number. Electron. J. Comb. 13(1), #R16 (2006)

  8. Fiori C., Mazzuoccolo G., Ruini B.: On the automorphic cromatic index of a graph. Graphs Comb. 26(5), 685–694 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  9. Fiori C., Mazzuoccolo G., Ruini B.: Computing the automorphic chromatic index of certain infinite classes of snarks. Results Math. 58, 241–254 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  10. Mazzuoccolo G.: The NP-completeness of automorphic colorings. Discuss. Math. Graph Theory 30, 705–710 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  11. Mazzuoccolo G., Ruini B.: Automorphic chromatic index of generalized Petersen graphs. AKCE Int. J. Graphs Comb. 6, 429–437 (2009)

    MATH  MathSciNet  Google Scholar 

  12. Schmeichel, I.: Automorphismen von Graphen mit zulässiger Kantenfärbung \({\phi}\). In: 2nd Colloquium for Geometry and Combinatorics, Part 1, 2, pp. 244–246 (1983)

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze Fisiche, Informatiche e Matematiche, Università di Modena e Reggio Emilia, via Campi 213/B, 41125, Modena, Italy

    Giuseppe Mazzuoccolo & Beatrice Ruini

Authors
  1. Giuseppe Mazzuoccolo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Beatrice Ruini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Giuseppe Mazzuoccolo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mazzuoccolo, G., Ruini, B. Upper Bounds for the Automorphic Chromatic Index of a Graph. Graphs and Combinatorics 30, 963–975 (2014). https://doi.org/10.1007/s00373-013-1321-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-013-1321-0

Keywords

Mathematics Subject Classification (2000)

Search

Navigation