Strong chromatic index of subset graphs
From MaRDI portal
Publication:3122901
DOI<267::AID-JGT8>3.0.CO;2-N 10.1002/(SICI)1097-0118(199703)23:3<267::AID-JGT8>3.0.CO;2-NzbMath0880.05037MaRDI QIDQ3122901
Arthur T. Benjamin, Jennifer J. Quinn Massey
Publication date: 28 January 1998
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199703)23:3<267::aid-jgt8>3.0.co;2-n
05C15: Coloring of graphs and hypergraphs
Related Items
Strong Chromatic Index of 2-Degenerate Graphs, Revisiting semistrong edge‐coloring of graphs, The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs, A note on the strong edge-coloring of outerplanar graphs with maximum degree 3, A note on the strong chromatic index of bipartite graphs, Strong edge colorings of uniform graphs