The strong chromatic index of graphs with edge weight eight | Journal of Combinatorial Optimization Skip to main content
Springer Nature Link
Log in

The strong chromatic index of graphs with edge weight eight

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

The edge weight of a graph G is defined to be \(\max \{d_G(u) + d_G(v): uv \in E(G)\}\). The strong chromatic index of a graph is the minimum value of k such that the edge set of G can be partitioned into k induced matchings. In this article, we prove that the strong chromatic index of a graph with edge weight eight is at most 21.

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
¥17,985 /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 includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Chen L, Huang M, Yu G, Zhou X (2020) The strong edge-coloring for graphs with small edge weight. Discrete Math 343:111779

    Article  MathSciNet  Google Scholar 

  • Debski M (2019) Strong chromatic index of unit distance graph. J Graph Theory 90:523–534

    Article  MathSciNet  Google Scholar 

  • Deng K, Yu G, Zhou X (2019) Recent progress on strong edge-coloring of graphs. Discrete Math Algorithms Appl 11:1950062

    Article  MathSciNet  Google Scholar 

  • Erdős P, Nešetřil J (1989) Problems. In: Halasz G, Sòs VT (eds) Irregularities of partitions. Springer, Berlin, pp 162–163

    Google Scholar 

  • Fouquet JL, Jolivet JL (1983) Strong edge-colorings of graphs and applications to multi-k-gons. Ars Combin 16A:141–150

    MathSciNet  MATH  Google Scholar 

  • Hall P (1935) On representatives of subsets. J London Math Soc 10(1):26

    Article  Google Scholar 

  • Huang M, Santana M, Yu G (2018) Strong chromatic index of graphs with maximum degree four. Electron J Comb 25(3):3. 31

    Article  MathSciNet  Google Scholar 

  • Yang Z, Wu B (2018) Strong edge chromatic index of the generalized Petersen graph. Appl Math Comput 321:431–441

    MathSciNet  MATH  Google Scholar 

  • Wu J, Lin W (2008) The strong chromatic index of a class of graphs. Discrete Math 308:6254–6261

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The first author is supported by the National Natural Science Foundation of China(11501223,11701195), and Quanzhou High-Level Talents Support Plan. The second author is supported by Subsidized Project for Postgraduates’ Innovative Fund in Scientific Research of Huaqiao University.

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, Huaqiao University, Quanzhou, China

    Lily Chen, Shumei Chen, Ren Zhao & Xiangqian Zhou

Authors
  1. Lily Chen
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Shumei Chen
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Ren Zhao
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Xiangqian Zhou
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Lily Chen.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, L., Chen, S., Zhao, R. et al. The strong chromatic index of graphs with edge weight eight. J Comb Optim 40, 227–233 (2020). https://doi.org/10.1007/s10878-020-00582-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-020-00582-4

Keywords

Mathematics Subject Classification