Skip to main content
Log in

On (st)-relaxed strong edge-coloring of graphs

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

Abstract

In this paper, we introduce a new relaxation of strong edge-coloring. Let G be a graph. For two nonnegative integers s and t, an (st)-relaxed strong k-edge-coloring is an assignment of k colors to the edges of G, such that for any edge e, there are at most s edges adjacent to e and t edges which are distance two apart from e assigned the same color as e. The (st)-relaxed strong chromatic index, denoted by \({\chi '}_{(s,t)}(G)\), is the minimum number k of an (st)-relaxed strong k-edge-coloring admitted by G. This paper studies the (st)-relaxed strong edge-coloring of graphs, especially trees. For a tree T, the tight upper bounds for \({\chi '}_{(s,0)}(T)\) and \({\chi '}_{(0,t)}(T)\) are given. And the (1, 1)-relaxed strong chromatic index of an infinite regular tree is determined. Further results on \({\chi '}_{(1,0)}(T)\) are also presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  • Andersen LD (1992) The strong chromatic index of a cubic graph is at most 10. Discret Math 108:231–252

    Article  MathSciNet  MATH  Google Scholar 

  • Barrett CL, Istrate G, Anil Kumar VS, Marathe Mv, Thite S, Thulasidasan S (2006) Strong edge coloring for channel assignment in wireless radio networks. In: Proceedings of the PERCOMW, pp. 13–17

  • Bondy JA, Murty USR (2008) Graph theory. Springer, New York

    Book  MATH  Google Scholar 

  • Cranston D (2006) Strong edge-coloring graphs with maximum degree 4 using 22 colors. Discret Math 306:2772–2778

    Article  MathSciNet  MATH  Google Scholar 

  • Erdős P, Nešetřil J (1989) Problem. In: Halász G, Sós VT (eds) Irregularities of partitions. Springer, Berlin, pp 162–163

    Google Scholar 

  • Fandree RJ, Gyárfás A, Schelp RH, Tuza ZS (1990) The strong chromatic index of graphs. Ars Combin 29 B:205–211

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

    MathSciNet  MATH  Google Scholar 

  • Fouquet JL, Jolivet J (1984) Strong edge-coloring of cubic plannar graphs. In: Progress in Graphy Theory (Waterloo 1982), pp. 247–264

  • Gyárfás A, Hubenko A (2006) Semistrong edge coloring of graphs. J Graphy Theory 49(1):39–47

    Article  MathSciNet  MATH  Google Scholar 

  • Horák P (1990) The strong chromatic index of graphs with maximum degree four. In: Contempopary Methods Graphy Theory, pp. 399-403

  • Horák P, Qing H, Trotter WT (1993) Induced mathching in cubic graphs. J Graph Theory 17:151–160

    Article  MathSciNet  MATH  Google Scholar 

  • Mahdian M (2000) The strong chromatic index of \(C_4\)-free graphs. Random Struct Algorithm 17:357–375

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

Supported by Natural Science Foundation of Jiangsu Province of China (No. BK20151399).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wensong Lin.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

He, D., Lin, W. On (st)-relaxed strong edge-coloring of graphs. J Comb Optim 33, 609–625 (2017). https://doi.org/10.1007/s10878-015-9983-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-015-9983-6

Keywords

Mathematics Subject Classification

Navigation