Skip to main content
SpringerLink
Log in

Strong edge-colorings for \(k\)-degenerate graphs

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

Abstract

We prove that the strong chromatic index for each \(k\)-degenerate graph with maximum degree \(\Delta \) is at most \((4k-2)\Delta -k(2k-1)+1\). This confirms a conjecture of Chang and Narayanan.

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. Andersen, L.D.: The strong chromatic index of a cubic graph is at most 10. Topological, algebraical and combinatorial structures. Frolík’s memorial volume. Discrete Math. 108(1–3), 231–252 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chang, G.J., Narayanan, N.: Strong chromatic index of 2-degenerate graphs. J. Gr. Theory 73(2), 119–126 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chung, F.R.K., Gyárfás, A., Trotter, W.T., Tuza, Z.: The maximum number of edges in \(2K_2\)-free graphs of bounded degree. Discrete Math. 81(2), 129–135 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  4. Cranston, D.W.: Strong edge-coloring of graphs with maximum degree 4 using 22 colors. Discrete Math. 306(21), 2772–2778 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fouquet, J.L., Jolivet, J.L.: Strong edge-coloring of graphs and applications to multi-k-gons. Ars Combinatoria 16A, 141–150 (1983)

    MathSciNet  Google Scholar 

  6. Horák, P., He, Q., Trotter, W.T.: Induced matchings in cubic graphs. J. Gr. Theory 17(2), 151–160 (1993)

    Article  MATH  Google Scholar 

  7. Luo, R., Yu, G.: A note on strong edge-colorings of \(2\)-degenerate graphs. http://arxiv.org/abs/1212.6092

  8. Molloy, M., Reed, B.: A bound on the strong chromatic index of a graph. J. Combin. Theory Ser. B 69(2), 103–109 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  9. Steibitz, M., Scheide, D., Toft, B., Favrholdt, L.M.: Graph Edge Coloring. Wiley, New York (2012)

    Google Scholar 

Download references

Acknowledgments

The author would like to thank Rong Luo and Zixia Song for their encouragements and discussions. The author’s research was supported in part by an NSA grant.

Author information

Authors and Affiliations

  1. Department of Mathematics, College of William and Mary, Williamsburg, VA, 23185, USA

    Gexin Yu

Authors
  1. Gexin Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gexin Yu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yu, G. Strong edge-colorings for \(k\)-degenerate graphs. Graphs and Combinatorics 31, 1815–1818 (2015). https://doi.org/10.1007/s00373-014-1478-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-014-1478-1

Keywords

Search

Navigation