research
â
05/20/2020
A Unifying Model for Locally Constrained Spanning Tree Problems
Given a graph G and a digraph D whose vertices are the edges of G, we in...
share
research
â
12/29/2019
An integer programming approach for solving a generalized version of the Grundy domination number
A sequence of vertices in a graph is called a legal dominating sequence ...
research
â
11/25/2019
Polyhedral study of the Convex Recoloring problem
A coloring of the vertices of a connected graph is convex if each color ...
research
â
11/29/2018
