Showing cs.DMShow all
2 papers · 1 filter
cs.DM2018
A Branch and Price Algorithm for List Coloring Problem
Mauro Lucci, Graciela Nasini, Daniel Severín
Coloring problems in graphs have been used to model a wide range of real applications. In particular, the List Coloring Problem generalizes the well-known Graph Coloring Problem fo…
cs.DM2018
The polytope of legal sequences
Manoel Campêlo, Daniel Severín
A sequence of vertices in a graph is called a \emph{(total) legal dominating sequence} if every vertex in the sequence (total) dominates at least one vertex not dominated by those…