- NP-completeness results for edge modification Pablo Burzyn a,1
- Between coloring and list-coloring: -coloring Flavia Bonomo 1,2
- Tesis de Licenciatura Sobre caracterizaciones parciales de grafos coordinados
- A Framework for Scheduling Professional Sports Leagues
- Perfect graphs Clique-perfect graphs
- Introduccion a la teoria de grafos Practica 1: Definiciones y propiedades basicas
- Exploring the complexity boundary between coloring and list-coloring
- Diciembre 2005 Director: Dr. Guillermo A. Duran
- Self-clique Helly circular-arc graphs Flavia Bonomo 1
- Introduccion a la teoria de grafos Practica 2: Problemas de camino minimo
- Abstract--This paper introduces a framework for a highly constrained sports scheduling problem which is modeled from
- Tesis de Licenciatura Optimizacion de la recoleccion de residuos en la
- Grafos perfeitos Grafos clique-perfeitos
- Minimum Sum Coloring of P4-sparse graphs 1 Flavia Bonomo a,2
- On coloring problems with local constraints Flavia Bonomo a,b,1,2
- Tesis de Licenciatura COMPLEJIDAD COMPUTACIONAL EN
- Mathematical Programming manuscript No. (will be inserted by the editor)
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of
- Analysis and Models of Bilateral Investment Treaties using a Social Networks Approach
- An application of the traveling tournament problem: the Argentine volleyball league
- Revista Ingenieria de Sistemas Volumen XXIII, Septiembre 2009 Optimizacion de la Recoleccion de
- Flavia Bonomo Curriculum Vitae
- Introduccion a la teoria de grafos Practica 3: Problemas de flujo maximo
- Introduccion a la Teoria de Grafos Flavia Bonomo
- Definitions and preliminaries Known partial characterizations of clique-perfect graphs
- Problemas Abiertos en Teoria de Grafos y Combinatoria
- On the b-coloring of cographs and P4-sparse graphs Flavia Bonomo1
- Introduccion a la Teoria de Grafos Flavia Bonomo
- Que es un grafo? Ejemplos de la vida real
- Partial characterizations of clique-perfect Flavia Bonomo a,1,4
- A polyhedral study of the maximum edge subgraph problem
- On the b-coloring of P4-tidy graphs Clara Ines Betancur Velasqueza,b,1
- Annals of Operations Research manuscript No. (will be inserted by the editor)
- Introduccion a la teoria de grafos Practica 0: Induccion
- On minimal forbidden subgraph characterizations of balanced graphs1
- Tesis de Licenciatura Entre k-coloreo y coloreo con
- k-coloring, list-coloring, -coloring Complexity issues
- Definiciones Caracterizaciones conocidas
- Definiciones basicas Circuitos, planaridad y coloreo
- A mi familia, que son lo que m as quiero en el mundo Agradecimientos
- Computational complexity of edge modi cation problems in di erent classes of
- Coordinated graphs and clique graphs of clique-Helly perfect graphs
- Introduccion a la Teoria de Grafos Flavia Bonomo
- Characterization and recognition of Helly circular-arc clique-perfect graphs
- Representacion de grafos Algoritmos para recorrido de grafos
- Partial Characterizations of Circular-Arc F. Bonomo a,1,3
- COMPUTATIONAL COMPLEXITY OF CLASSICAL PROBLEMS FOR HEREDITARY CLIQUE-HELLY GRAPHS
- Partial characterizations of clique-perfect graphs I: subclasses of claw-free graphs
- Graph coloring problems Complexity issues
- UNIVERSIDAD DE BUENOS AIRES Facultad de Ciencias Exactas y Naturales
