The minimum chromatic violation problem : a polyhedral approach

Revista con referato

Guardado en:

Detalles Bibliográficos
Autores principales:	Braga, Mónica Andrea, Delle Donne, Diego, Escalante, Mariana Silvina, Marenco, Javier, Ugarte, María Elisa, Varaldo, María del Carmen
Formato:	Artículo publishedVersion
Lenguaje:	Inglés
Publicado:	Elsevier Science BV 2025
Materias:	Chromatic violation Graph coloring K-partition Polyhedral study Matemáticas
Acceso en línea:	http://repositorio.ungs.edu.ar:8080/xmlui/handle/UNGS/2036
Aporte de:	Repositorio Institucional Digital de Acceso Abierto (UNGS) de Universidad Nacional de General Sarmiento

Ejemplares similares

Polyhedral studies of vertex coloring problems: The standard formulation
por: Delle Donne, D., et al.

Polyhedral studies of vertex coloring problems: The standard formulation
por: Delle Donne, Diego, et al.
Publicado: (2016)

On the combinatorial structure of chromatic scheduling polytopes
por: Marenco, Javier Leonardo
Publicado: (2006)

On the combinatorial structure of chromatic scheduling polytopes
por: Marenco, J., et al.
Publicado: (2006)

On the combinatorial structure of chromatic scheduling polytopes
por: Marenco, J., et al.
Publicado: (2006)

On the combinatorial structure of chromatic scheduling polytopes
por: Marenco, J., et al.

k-tuple chromatic number of the cartesian product of graphs
por: Bonomo, F., et al.

k-tuple chromatic number of the cartesian product of graphs
por: Bonomo, Flavia, et al.
Publicado: (2015)

Polyhedral study of the 2-dominating set polytope of cycles and cactus graphs
por: Argiroffo, G., et al.
Publicado: (2013)

k-tuple colorings of the Cartesian product of graphs
por: Bonomo, F., et al.

k-tuple colorings of the Cartesian product of graphs
por: Bonomo, Flavia, et al.
Publicado: (2017)

Combinatorial equivalence of Chromatic Scheduling Polytopes
por: Marenco, Javier Leonardo
Publicado: (2004)

Minimum sum set coloring of trees and line graphs of trees
por: Bonomo, Flavia, et al.
Publicado: (2011)

Combinatorial equivalence of Chromatic Scheduling Polytopes
por: Marenco, J., et al.

A polyhedral approach for graph coloring
por: Méndez Díaz, I., et al.

A polyhedral approach for graph coloring
por: Méndez Díaz, Isabel, et al.
Publicado: (2000)

Minimum sum set coloring of trees and line graphs of trees
por: Bonomo, F., et al.
Publicado: (2011)

Minimum sum set coloring of trees and line graphs of trees
por: Bonomo, F., et al.
Publicado: (2011)

Minimum sum set coloring of trees and line graphs of trees
por: Bonomo, F., et al.

Cycle-based facets of chromatic scheduling polytopes
por: Marenco, Javier Leonardo
Publicado: (2009)

Cycle-based facets of chromatic scheduling polytopes
por: Marenco, J., et al.

Appendix and source code of ACP solver for the paper On the additive chromatic number of several families of graphs
por: Severín, Daniel Esteban
Publicado: (2020)

On the b-coloring of P4-tidy graphs
por: Velasquez, C.I.B., et al.
Publicado: (2011)

On the b-coloring of P4-tidy graphs
por: Velasquez, C.I.B., et al.
Publicado: (2011)

On the b-coloring of P4-tidy graphs
por: Velasquez, C.I.B., et al.

On the b-coloring of P4-tidy graphs
por: Bonomo, Flavia, et al.
Publicado: (2011)

A polyhedral approach for the equitable coloring problem
por: Méndez-Díaz, I., et al.

A polyhedral approach for the equitable coloring problem
por: Méndez Díaz, Isabel, et al.
Publicado: (2014)

Direct test of time reversal invariance violation in B-mesons
por: Álvarez, E., et al.

Direct test of time reversal invariance violation in B-mesons
por: Szynkman, Alejandro Andrés
Publicado: (2008)

Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
por: Marenco, Javier Leonardo
Publicado: (2007)

On the Minimum Sum Coloring of P4-Sparse Graphs
por: Bonomo, F., et al.

On the Minimum Sum Coloring of P 4-Sparse Graphs
por: Bonomo, F., et al.

On the Minimum Sum Coloring of P4-Sparse Graphs
Publicado: (2014)

On the Minimum Sum Coloring of P 4-Sparse Graphs
por: Bonomo, Flavia
Publicado: (2012)

Polyhedral results for the equitable coloring problem
por: Méndez-Diaz, I., et al.

Polyhedral results for the equitable coloring problem
por: Méndez Díaz, Isabel, et al.
Publicado: (2011)

Chromatic scheduling polytopes coming from the bandwidth allocation problem in point-to-multipoint radio access systems
por: Marenco, J.L., et al.

A polyhedral study of the maximum edge subgraph problem
por: Bonomo, F., et al.
Publicado: (2012)

A polyhedral study of the maximum edge subgraph problem
por: Bonomo, F., et al.