SciELO - Scientific Electronic Library Online

SciELO - Scientific Electronic Library Online

Referencias del artículo

SOULIGNAC, Francisco  y  SUEIRO, Gabriel. Exponential families of minimally non-coordinated graphs. Rev. Unión Mat. Argent. [online]. 2009, vol.50, n.1, pp. 75-85. ISSN 0041-6932.

    [1]    Claude Berge. Les problèmes de coloration en théorie des graphes. Publ. Inst. Statist. Univ. Paris, 9:123-160, 1960. [ Links ]

    [2]    Flavia Bonomo, Maria Chudnovsky, and Guillermo Durán. Partial characterizations of clique-perfect graphs. I. Subclasses of claw-free graphs. Discrete Appl. Math., 156(7):1058-1082, 2008. [ Links ]

    [3]    Flavia Bonomo, Guillermo Durán, and Marina Groshaus. Coordinated graphs and clique graphs of clique-Helly perfect graphs. Util. Math., 72:175-191, 2007. [ Links ]

    [4]    Flavia Bonomo, Guillermo Durán, Francisco Soulignac, and Gabriel Sueiro. Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs. Discrete Appl. Math., 2009. In press. [ Links ]

    [5]    Flavia Bonomo, Guillermo Durán, Francisco Soulignac, and Gabriel Sueiro. Partial characterizations of coordinated graphs: line graphs and complements of forests. Math. Methods Oper. Res., 69(2):251-270, 2009. [ Links ]

    [6]    Maria Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul Seymour, and Kristina Vuskovic. Recognizing Berge graphs. Combinatorica, 25(2):143-186, 2005. [ Links ]

    [7]    Maria Chudnovsky, Neil Robertson, Paul Seymour, and Robin Thomas. The strong perfect graph theorem. Ann. Math. (2), 164(1):51-229, 2006. [ Links ]

    [8]    M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1(2):169-197, 1981. [ Links ]

    [9]    Francisco Soulignac and Gabriel Sueiro. Np-hardness of the recognition of coordinated graphs. Ann. Oper. Res., 169(1):17-34, 2009. [ Links ]