Lista de

Diamond-free graphs
10
"Approximating weighted neighborhood independent sets" (2018) Lin, M.C.; Mestre, J.; Vasiliev, S. Information Processing Letters. 130:11-15
"On probe 2-clique graphs and probe diamond-free graphs" (2015) Bonomo, F.;De Figueiredo, C.M.H.;Durán, G. (...)Szwarcfiter, J.L. Discrete Mathematics and Theoretical Computer Science. 17(1):187-200
"On probe 2-clique graphs and probe diamond-free graphs" (2015) Bonomo, F.;De Figueiredo, C.M.H.;Durán, G. (...)Szwarcfiter, J.L. Discrete Mathematics and Theoretical Computer Science. 17(1):187-200
"Clique-perfectness and balancedness of some graph classes" (2014) Bonomo, F.; Durán, G.; Safe, M.D.; Wagler, A.K. International Journal of Computer Mathematics. 91(10):2118-2141
"Clique-perfectness and balancedness of some graph classes" (2014) Bonomo, F.; Durán, G.; Safe, M.D.; Wagler, A.K. International Journal of Computer Mathematics. 91(10):2118-2141
"Arboricity, h-index, and dynamic algorithms" (2012) Lin, M.C.; Soulignac, F.J.; Szwarcfiter, J.L. Theoretical Computer Science. 426-427:75-90
"Arboricity, h-index, and dynamic algorithms" (2012) Lin, M.C.; Soulignac, F.J.; Szwarcfiter, J.L. Theoretical Computer Science. 426-427:75-90
"Partial characterizations of circular-arc graphs" (2009) Bonomo, F.; Durán, G.; Grippo, L.N.; Safe, M.D. Journal of Graph Theory. 61(4):289-306
"Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs" (2009) Bonomo, F.; Chudnovsky, M.; Durán, G. Discrete Mathematics. 309(11):3485-3499
"Partial Characterizations of Circular-Arc Graphs" (2008) Bonomo, F.; Durán, G.; Grippo, L.N.; Safe, M.D. Electronic Notes in Discrete Mathematics. 30(C):45-50