Flavia Bonomo-Braberman

From MaRDI portal
Person:831860

Available identifiers

zbMath Open bonomo-braberman.flaviaMaRDI QIDQ831860

List of research outcomes

PublicationDate of PublicationType
Solving problems on generalized convex graphs via mim-width2024-01-04Paper
Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs2023-12-11Paper
Linear‐time algorithms for eliminating claws in graphs2023-11-29Paper
Minimum weighted clique cover on claw‐free perfect graphs2023-09-29Paper
On the thinness of trees2023-08-03Paper
Forbidden induced subgraph characterization of circle graphs within split graphs2022-11-02Paper
Precedence thinness in graphs2022-11-02Paper
A new approach on locally checkable problems2022-04-20Paper
Solving problems on generalized convex graphs via mim-width2022-03-25Paper
Thinness of product graphs2022-03-24Paper
On some special classes of contact \(B_0\)-VPG graphs2022-01-05Paper
Linear-time algorithms for eliminating claws in graphs2021-04-21Paper
Better 3-coloring algorithms: excluding a triangle and a seven vertex path2020-12-16Paper
Fractional hypergraph isomorphism and fractional invariants2020-08-19Paper
Thinness of product graphs2020-06-30Paper
Precedence thinness in graphs2020-06-30Paper
Characterising circular-arc contact \(B_0\)-VPG graphs2020-06-29Paper
On some graph classes related to perfect graphs: a survey2020-05-29Paper
A note on homomorphisms of Kneser hypergraphs2020-01-15Paper
On the thinness and proper thinness of a graph2019-05-17Paper
Perfectness of clustered graphs2018-10-18Paper
Three-coloring and list three-coloring of graphs without induced paths on seven vertices2018-09-24Paper
Characterising chordal contact \(B_0\)-VPG graphs2018-08-17Paper
https://portal.mardi4nfdi.de/entity/Q45681752018-06-15Paper
\(k\)-tuple colorings of the Cartesian product of graphs2018-05-24Paper
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid2017-12-20Paper
An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools2017-12-15Paper
Domination parameters with number 2: interrelations and algorithmic consequences2017-12-06Paper
Vertex intersection graphs of paths on a grid: characterization within block graphs2017-10-11Paper
Clique coloring \(B_1\)-EPG graphs2017-02-27Paper
\(k\)-tuple chromatic number of the Cartesian product of graphs2016-10-17Paper
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid2016-10-17Paper
Graph classes with and without powers of bounded clique-width2015-12-10Paper
\(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs2015-10-19Paper
\(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs2015-10-16Paper
Complexity of the cluster deletion problem on subclasses of chordal graphs2015-09-16Paper
Clique-perfectness of complements of line graphs2015-05-22Paper
A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs2015-05-21Paper
https://portal.mardi4nfdi.de/entity/Q52492362015-04-30Paper
Clique-perfectness and balancedness of some graph classes2014-11-28Paper
On the minimum sum coloring of \(P_4\)-sparse graphs2014-09-19Paper
https://portal.mardi4nfdi.de/entity/Q51677202014-07-01Paper
Mathematical programming as a tool for virtual soccer coaches: a case study of a fantasy sport game2014-06-20Paper
Characterization of classical graph classes by weighted clique graphs2014-05-05Paper
On minimal forbidden subgraph characterizations of balanced graphs2014-04-22Paper
A note on the Cornaz-Jost transformation to solve the graph coloring problem2014-04-11Paper
Forbidden subgraphs and the König-Egerváry property2014-04-10Paper
https://portal.mardi4nfdi.de/entity/Q57473962014-02-14Paper
https://portal.mardi4nfdi.de/entity/Q28615422013-11-08Paper
Clique-perfectness of complements of line graphs2013-07-23Paper
Minimum Sum Coloring of P4-sparse graphs2013-07-19Paper
On minimal forbidden subgraph characterizations of balanced graphs2013-07-19Paper
A polyhedral study of the maximum edge subgraph problem2013-07-19Paper
On coloring problems with local constraints2013-07-19Paper
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property2013-03-19Paper
A polyhedral study of the maximum edge subgraph problem2012-11-22Paper
Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs2012-11-06Paper
https://portal.mardi4nfdi.de/entity/Q29186372012-10-08Paper
https://portal.mardi4nfdi.de/entity/Q29184692012-10-06Paper
On coloring problems with local constraints2012-06-18Paper
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem2012-01-09Paper
Partial characterizations of circle graphs2011-10-27Paper
On theL(2, 1)-labelling of block graphs2011-04-06Paper
Minimum sum set coloring of trees and line graphs of trees2011-03-10Paper
On the \(b\)-coloring of \(P_{4}\)-tidy graphs2011-01-14Paper
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs2010-04-28Paper
Partial characterizations of circular-arc graphs2009-12-18Paper
On the b-coloring of cographs and \(P_{4}\)-sparse graphs2009-12-09Paper
Exploring the complexity boundary between coloring and list-coloring2009-09-03Paper
Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs2009-06-19Paper
Partial characterizations of coordinated graphs: Line graphs and complements of forests2009-04-27Paper
Partial Characterizations of Circular-Arc Graphs2008-06-05Paper
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs2008-06-05Paper
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs2008-04-16Paper
https://portal.mardi4nfdi.de/entity/Q35951142007-08-10Paper
Characterization and recognition of Helly circular-arc clique-perfect graphs2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34396682007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34396722007-05-29Paper
Exploring the complexity boundary between coloring and list-coloring2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34286692007-03-29Paper
NP-completeness results for edge modification problems2006-08-17Paper
Self-clique Helly circular-arc graphs2006-05-16Paper
On balanced graphs2006-01-13Paper
https://portal.mardi4nfdi.de/entity/Q57084872005-11-18Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Flavia Bonomo-Braberman