8 citations · 8 across the 6 of their papers we have counts for
3 papers · 1 filter
Trees with proper thinness 2
Flavia Bonomo-Braberman, Ignacio Maqueda, Nina Pardal
The proper thinness of a graph is an invariant that generalizes the concept of a proper interval graph. Every graph has a numerical value of proper thinness and the graphs with pro…
Fractional hypergraph isomorphism and fractional invariants
Flavia Bonomo-Braberman, Dora Tilli
Fractional graph isomorphism is the linear relaxation of an integer programming formulation of graph isomorphism. It preserves some invariants of graphs, like degree sequences and…
Better 3-coloring algorithms: excluding a triangle and a seven vertex path
Flavia Bonomo-Braberman, Maria Chudnovsky, Jan Goedgebeur +4
We present an algorithm to color a graph with no triangle and no induced -vertex path (i.e., a -free graph), where every vertex is assigned a list of possible c…