LAGOS V Latin-American Algorithms, Graphs and Optimization...
www.inf.ufrgs.br
On minimal forbidden subgraph characterizations of balanced graphs, Flavia Bonomo (Universidad de Buenos Aires), Guillermo Durán (Universidad de Buenos Aires y Universidad de Chile), Martín Safe (CONICET and Universidad de Buenos Aires), Annegret Wagler (Otto-von-Guericke-University Magdeburg).
[ ] Better 3-coloring algorithms: excluding a triangle and a...
arxiv.org
Title: 3-Colouring graphs without triangles or induced paths on seven vertices. Authors: Flavia Bonomo, Oliver Schaudt, Maya Stein (Submitted on 30 Sep
CiteSeerX — Minimum Sum Coloring of P4-sparse graphs
citeseerx.ist.psu.edu
BibTeX @MISC{Bonomo09minimumsum, author = {Flavia Bonomo and Mario Valencia-Pabon}, title = {Minimum Sum Coloring of P4-sparse graphs}, year = {2009}}
[ ] b-coloring is NP-hard on co-bipartite graphs and polytime...
arxiv.org
Oct 29, · Title: b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. Authors: Flavia Bonomo, Oliver Schaudt, Maya Stein,
[ ] On the thinness and proper thinness of a graph
arxiv.org
Authors: Flavia Bonomo, Diego de Estrada. (Submitted on 2 Apr (v1), last revised 20 Jan (this version, v3)). Abstract: Graphs with bounded thinness were defined in as a generalization of interval graphs. In this paper we introduce the concept of proper thinness, such that graphs with bounded proper ...
EconPapers: Bounded coloring of co-comparability graphs and the...
econpapers.repec.org
By Flavia Bonomo, Sara Mattia and Gianpaolo Oriolo; Abstract: The Double Traveling Salesman Problem with Multiple Stacks is a vehicle routing problem in ...
On the b-Coloring of Cographs and P 4-Sparse Graphs | SpringerLink
link.springer.com
A b-coloring of a graph is a coloring such that every color class admits a vertex adjacent to at least one vertex receiving each of the colors not assigned
All web results to the name "Flavia Bonomo"
(PDF) On balanced graphs | Flavia Bonomo - Academia.edu
www.academia.edu
By Flavia Bonomo. Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this concept applied to graphs, and call a graph...
Flavia Bonomo - Universidad de Buenos Airesstaff.dc.uba.ar › fbonomo › publicaciones
staff.dc.uba.ar
and Snels C., "Minimum weighted clique cover on claw-free perfect graphs", Journal of Graph Theory 96(2), 2021, [link] [PDF]. Flavia Bonomo-Braberman ...
TDGS - "Flavia Bonomo"
juliette.lsi.us.es
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
(PDF) On weighted clique graphs | Flavia Bonomo - Academia.edu
www.academia.edu
Matem´tica Contemporˆnea, Vol 39, a a c 2010, Sociedade Brasileira de Matem´tica a On weighted clique graphs Flavia Bonomo∗ Jayme L. Szwarcfiter Abstract
PUBLICATIONS OF MARIO VALENCIA …
lipn.univ-paris13.fr
PUBLICATIONS OF MARIO VALENCIA-PABON. Preprints. Homomorphisms of Kneser hypergraphs (with Flavia Bonomo, Mitre Costa Dourado, Juan Carlos Vera Lizcano).
VIII Latin-American Algorithms, Graphs and Optimization Symposium -...
lia.ufc.br
8:15: Plenary Session (João-de-Castro Room) - Chair: Flavia Bonomo Miguel Pizaña: Discrete Homotopy on Graphs and Clique Graphs: 9:15: Break: 9:20: João-de-Castro ...
(PDF) Self-clique Helly circular-arc graphs | Flavia Bonomo -...
www.academia.edu
By Flavia Bonomo. A clique in a graph is a complete subgraph maximal under inclusion. The clique graph of a graph is the intersection graph of its cliques. A...
DataCite Search
search.datacite.org
Clique coloring B1-EPG graphs. María Pía Mazzoleni, Flavia Bonomo & Maya Stein. Work published via Unpublished. https://doi.org rg Cite ...
Linear-Time Algorithms for Eliminating Claws in Graphs ...www.springerprofessional.de › linear-time-algorithms-for-eliminating-claw...
www.springerprofessional.de
Authors: Flavia Bonomo-Braberman, Julliano R. Nascimento, Fabiano S. Oliveira, Uéverton S. Souza, Jayme L. Szwarcfiter. Publisher: Springer International ...
PUBLICATIONS OF MARIO VALENCIA-PABON Journals On the P3 ...www-lipn.univ-paris13.fr › ~valencia › publis
www-lipn.univ-paris13.fr
k-tuple colorings of the cartesian product of graphs (with Flavia Bonomo, Ivo Koch, Pablo Torres). Discrete Applied Mathematics, Vol. 245, pp ,
LAGOS’17 – IX Latin and American Algorithms, Graphs and Optimization...
www.ifors.org
The International Federation of Operational Research Societies IFORS is an umbrella organization comprising the national Operations Research societies of over...
On probe 2-clique graphs and probe diamond-free graphs - Inria
hal.inria.fr
Given a class G of graphs, probe G graphs are defined as follows. A graph G is probe G if there exists a partition of its vertices into a set of probe vertices...
Related search requests for Flavia Bonomo
Pablo Torres Guillermo Durán Maya Stein |
People Forename "Flavia" (4037) Name "Bonomo" (383) |
sorted by relevance / date