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

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 371; s. 80 - 98
Hlavní autori:	Curcio, Brian, Méndez-Díaz, Isabel, Zabala, Paula
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 15.08.2025
Predmet:	Branch and Cut Edge coloring Vertex distinguishing Branch and Cut Edge coloring Vertex distinguishing
ISSN:	0166-218X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!