Twin chromatic indices of some graphs with maximum degree 3

• Main Authors: Tolentino, Jayson D, Marcelo, Reginaldo M, Tolentino, Mark Anthony C
• Format: text
• Published: Archīum Ateneo 2020
• Subjects: Mathematics
• Online Access: https://archium.ateneo.edu/mathematics-faculty-pubs/125; https://archium.ateneo.edu/cgi/viewcontent.cgi?article=1124&context=mathematics-faculty-pubs
• Institution: Ateneo De Manila University

Let k ≥ 2 be an integer and G be a connected graph of order at least 3. A twin k-edge coloring of G is a proper edge coloring of G that uses colors from k and that induces a proper vertex coloring on G where the color of a vertex v is the sum (in k ) of the colors of the edges incident with v. The...