The following pages link to Flavia Bonomo-Braberman (Q831860):
Displaying 50 items.
- (Q324795) (redirect page) (← links)
- \(k\)-tuple chromatic number of the Cartesian product of graphs (Q324798) (← links)
- Complexity of the cluster deletion problem on subclasses of chordal graphs (Q496003) (← links)
- Clique coloring \(B_1\)-EPG graphs (Q512582) (← links)
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs (Q617902) (← links)
- Minimum sum set coloring of trees and line graphs of trees (Q628310) (← links)
- Partial characterizations of circle graphs (Q643006) (← links)
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316) (← links)
- On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570) (← links)
- \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (Q747619) (← links)
- Thinness of product graphs (Q831864) (← links)
- Solving problems on generalized convex graphs via mim-width (Q832860) (← links)
- Graph classes with and without powers of bounded clique-width (Q896650) (← links)
- Partial characterizations of coordinated graphs: Line graphs and complements of forests (Q1014303) (← links)
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs (Q1025541) (← links)
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs (Q1043801) (← links)
- Characterising chordal contact \(B_0\)-VPG graphs (Q1661864) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools (Q1686513) (← links)
- \(k\)-tuple colorings of the Cartesian product of graphs (Q1752494) (← links)
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047) (← links)
- Perfectness of clustered graphs (Q1799385) (← links)
- Linear-time algorithms for eliminating claws in graphs (Q2019430) (← links)
- On some special classes of contact \(B_0\)-VPG graphs (Q2064288) (← links)
- Forbidden induced subgraph characterization of circle graphs within split graphs (Q2091783) (← links)
- Precedence thinness in graphs (Q2091785) (← links)
- A new approach on locally checkable problems (Q2127611) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- Characterising circular-arc contact \(B_0\)-VPG graphs (Q2192099) (← links)
- Better 3-coloring algorithms: excluding a triangle and a seven vertex path (Q2216431) (← links)
- A note on homomorphisms of Kneser hypergraphs (Q2284780) (← links)
- 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 graphs (Q2345859) (← links)
- Vertex intersection graphs of paths on a grid: characterization within block graphs (Q2409505) (← links)
- On the thinness and proper thinness of a graph (Q2414456) (← links)
- Forbidden subgraphs and the König-Egerváry property (Q2444529) (← links)
- A note on the Cornaz-Jost transformation to solve the graph coloring problem (Q2444903) (← links)
- Characterization of classical graph classes by weighted clique graphs (Q2448923) (← links)
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs (Q2482103) (← links)
- Self-clique Helly circular-arc graphs (Q2488933) (← links)
- NP-completeness results for edge modification problems (Q2500532) (← links)
- On balanced graphs (Q2583124) (← links)
- Minimum Sum Coloring of P4-sparse graphs (Q2840552) (← links)
- (Q2861542) (← links)
- (Q2918469) (← links)
- (Q2918637) (← links)
- Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)
- (Q3428669) (← links)
- Characterization and recognition of Helly circular-arc clique-perfect graphs (Q3439325) (← links)
- (Q3439668) (← links)
- (Q3439672) (← links)
