The strong clique index of a graph with forbidden cycles

[1]  Ross J. Kang,et al.  Strong cliques and forbidden cycles , 2019, Indagationes Mathematicae.

[2]  Gexin Yu,et al.  Strong Chromatic Index of Graphs With Maximum Degree Four , 2018, Electron. J. Comb..

[3]  Angelika Steger,et al.  On induced matchings , 1993, Discret. Math..

[4]  Mathias Schacht,et al.  On Six Problems Posed by Jarik Nešetřil , 2006 .

[5]  Daniel W. Cranston.  Strong edge-coloring of graphs with maximum degree 4 using 22 colors , 2006, Discret. Math..

[6]  Lars Døvling Anderson.  The strong chromatic index of a cubic graph is at most 10 , 1992 .

[7]  Henning Bruhn,et al.  A Stronger Bound for the Strong Chromatic Index , 2015, Combinatorics, Probability and Computing.

[8]  Malgorzata Sleszynska-Nowak.  Clique number of the square of a line graph , 2016, Discret. Math..

[9]  Luke Postle,et al.  On the clique number of the square of a line graph and its relation to maximum degree of the line graph , 2019, J. Graph Theory.

[10]  William T. Trotter,et al.  Induced matchings in cubic graphs , 1993, J. Graph Theory.

[11]  Zsolt Tuza,et al.  The maximum number of edges in 2K2-free graphs of bounded degree , 1990, Discret. Math..

[12]  G. Tinhofer.  Graphen und Matrizen , 1976 .

[13]  Mohammad Mahdian,et al.  The strong chromatic index of C 4 -free graphs , 2000 .

[14]  Bruce A. Reed,et al.  A Bound on the Strong Chromatic Index of a Graph, , 1997, J. Comb. Theory B.

[15]  Van H. Vu,et al.  A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs , 2002, Combinatorics, Probability and Computing.