An exact algorithm for the adjacent vertex distinguishing sum edge coloring problem

In this work we define the adjacent vertex distinguishing sum edge coloring problem. This problem consists of finding an assignment of colors to the edges of a graph with the following constraints: every pair of adjacent edges must have a different color, and every pair of adjacent vertices must not...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 371; pp. 80 - 98
Main Authors:	Curcio, Brian, Méndez-Díaz, Isabel, Zabala, Paula
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.08.2025
Subjects:	Branch and Cut Edge coloring Vertex distinguishing Branch and Cut Edge coloring Vertex distinguishing
ISSN:	0166-218X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!