Navegar

Colección

Datos Estadísticas

Lista de

Triangle-free graphs
7
"b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs" (2015) Bonomo, F.; Schaudt, O.; Stein, M.; Valencia-Pabon, M. Algorithmica. 73(2):289-305
"b-Coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs" (2014) Bonomo, F.;Schaudt, O.;Stein, M. (...)Associacao Portuguesa de Investigacao Operacional; de Lisboa, Centro de Investigacao Operacional; Faculdade de Ciencias da Universidade; Fundacao para a Ciencia e a Tecnologia; Instituto Nacional de Estatistica; Universite Paris-Dauphine, LAMSADE 3rd International Symposium on Combinatorial Optimization, ISCO 2014. 8596 LNCS:100-111
"Hereditary biclique-Helly graphs: Recognition and maximal biclique enumeration" (2013) Eguía, M.; Soulignac, F.J. Discrete Mathematics and Theoretical Computer Science. 15(1):55-74
"Hereditary biclique-Helly graphs: Recognition and maximal biclique enumeration" (2013) Eguía, M.; Soulignac, F.J. Discrete Mathematics and Theoretical Computer Science. 15(1):55-74
"Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs" (2009) Bonomo, F.; Durán, G.; Soulignac, F.; Sueiro, G. Discrete Applied Mathematics. 157(17):3511-3518
"Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs" (2009) Bonomo, F.; Durán, G.; Soulignac, F.; Sueiro, G. Discrete Applied Mathematics. 157(17):3511-3518
"Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs" (2008) Bonomo, F.; Durán, G.; Soulignac, F.; Sueiro, G. Electronic Notes in Discrete Mathematics. 30(C):51-56