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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics Jg. 371; S. 80 - 98
Hauptverfasser:	Curcio, Brian, Méndez-Díaz, Isabel, Zabala, Paula
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 15.08.2025
Schlagworte:	Branch and Cut Edge coloring Vertex distinguishing Branch and Cut Edge coloring Vertex distinguishing
ISSN:	0166-218X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!