The following pages link to Flavia Bonomo-Braberman (Q831860):
Displayed 34 items.
- Partial Characterizations of Circular-Arc Graphs (Q3503529) (← links)
- (Q3595114) (← links)
- Partial characterizations of circular-arc graphs (Q3652535) (← links)
- (Q4568175) (← links)
- Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property (Q4910807) (← links)
- Mathematical programming as a tool for virtual soccer coaches: a case study of a fantasy sport game (Q4979998) (← links)
- (Q5167720) (← links)
- Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs (Q5200491) (← links)
- (Q5249236) (← links)
- On the<i>L</i>(2, 1)-labelling of block graphs (Q5391500) (← links)
- (Q5708487) (← links)
- (Q5747396) (← links)
- On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid (Q5890935) (← links)
- On minimal forbidden subgraph characterizations of balanced graphs (Q5891090) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5891092) (← links)
- On coloring problems with local constraints (Q5891093) (← links)
- Clique-perfectness of complements of line graphs (Q5891101) (← links)
- On coloring problems with local constraints (Q5891606) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5896984) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5899384) (← links)
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs (Q5900083) (← links)
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs (Q5900860) (← links)
- On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid (Q5915780) (← links)
- A polyhedral study of the maximum edge subgraph problem (Q5916096) (← links)
- Clique-perfectness of complements of line graphs (Q5919747) (← links)
- On minimal forbidden subgraph characterizations of balanced graphs (Q5920323) (← links)
- Minimum weighted clique cover on claw‐free perfect graphs (Q6055392) (← links)
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs (Q6064836) (← links)
- Linear‐time algorithms for eliminating claws in graphs (Q6082274) (← links)
- On the thinness of trees (Q6166903) (← links)
- Solving problems on generalized convex graphs via mim-width (Q6183361) (← links)
- Thinness of product graphs (Q6344120) (← links)
- Precedence thinness in graphs (Q6344135) (← links)
- Fractional hypergraph isomorphism and fractional invariants (Q6347373) (← links)