Strong chromatic index of subset graphs

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.05037OpenAlexW2131980605MaRDI 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

zbMATH Keywords

intersection graphbipartite graphsstrong chromatic indexstrong edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Strong edge colorings of uniform graphs ⋮ The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs ⋮ Revisiting semistrong edge‐coloring of graphs ⋮ A note on the strong chromatic index of bipartite graphs ⋮ A note on the strong edge-coloring of outerplanar graphs with maximum degree 3 ⋮ Strong Chromatic Index of 2-Degenerate Graphs

This page was built for publication: Strong chromatic index of subset graphs