Strong chromatic index of subset graphs

DOI10.1002/(SICI)1097-0118(199703)23:3%3C267::AID-JGT8%3E3.0.CO;2-NMaRDI QIDQ3122901zbMATH OpenOpenAlexFDO

Authors Arthur T. Benjamin, Jennifer J. Quinn

Publication date 28 January 1998

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199703)23:3%3C267::aid-jgt8%3E3.0.co;2-n

zbMATH Keywords

intersection graphbipartite graphsstrong chromatic indexstrong edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Strong chromatic index in subset graphs
• A note on the strong chromatic index of bipartite graphs
• The strong chromatic index of \((3,\Delta)\)-bipartite graphs

Cited in

(11)

• Strong chromatic index in subset graphs
• Strong chromatic index of unit distance graphs
• The strong chromatic index of sparse graphs
• Strong chromatic index of 2-degenerate graphs
• A note on the strong chromatic index of bipartite graphs
• Revisiting semistrong edge‐coloring of graphs
• On Graphs With Prescribed Chromatic Number and Subset Index
• The strong chromatic index of \((3,\Delta)\)-bipartite graphs
• Strong edge colorings of uniform graphs
• A note on the strong edge-coloring of outerplanar graphs with maximum degree 3
• Semistrong edge coloring of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3122901)