Photo from wikipedia
A strong edge-coloring of a graph G is a proper edge-coloring such that every color class induces a matching. In this paper, we discuss the strong chromatic index of a… Click to show full abstract
A strong edge-coloring of a graph G is a proper edge-coloring such that every color class induces a matching. In this paper, we discuss the strong chromatic index of a cycle on k vertices and use the result to calculate the strong chromatic index of ( m,n ) k -gon snake graphs which generalize the families of graphs referred to as the ( m,n ) triangle snake graphs and ( m,n ) quadrilateral snake graphs.
Keywords:
snake graphs;
chromatic index;
strong chromatic;
index generalized;
generalized polygon
Journal Title: National Academy Science Letters
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: National Academy Science Letters
Year Published: 2020
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!