Strong chromatic index of graphs: a short survey

Abstract— A strong edge coloring of a graph G is an edge coloring such that every two adjacent edges or two edges adjacent to a same edge receive two distinct colors; in other words, every path of length three has three distinct colors in G. The strong chromatic index of G, denoted by , is the smallest integer k such that G admits a strong edge coloring with k colors. This survey is an brief introduction to some good results regarding the strong chromatic index of planar graphs, bipartite graphs and so on.

Keywords strong edge coloring; strong chromatic index.

Click here to Download Full Paper


Strong chromatic index of graphs

AD Publications is a rapidly growing academic publisher in the fields of Engineering, Medical-Health, Environmental Science and Agriculture Research. AD Publications is a registered organization broad-based open access and publishes most exciting researches with respect to the subjects of our journals. The Journals is being indexed and abstracted by all major global current awareness and alerting services.
The organization aims at undertaking, co- coordinating and promoting research and development. It provides professional and academic guidance in the field of basic education, Higher Education as well in the Technical Education. Our Aims is to Promote and support, High Quality basic, Scientific Research and development in fields of Engineering, Medical-Health, Environmental Science and Agriculture Research and to Generate Public awareness, provide advice to scholar’s researchers and communicate research outcomes.

Some Important Links About Research Journal
International Journal
Agriculture Journal
Medical Journal
Environmental Journal
Engineering Journal

Translate »