Browsing by Author "Safe, Martín D."

Now showing items 1-6 of 6

    • Clique-perfectness of complements of line graphs 
      Bonomo, Flavia; Durán, Guillermo; Safe, Martín D.; Wagler, Annegret K. (Elsevier, 2015)
      A graph is clique-perfect if the maximum number of pairwise disjoint maximal cliques equals the minimum number of vertices intersecting all maximal cliques for each induced subgraph. In this work, we give necessary and ...
    • Convex p-partitions of bipartite graphs 
      Grippo, Luciano N.; Matamala Vásquez, Martín; Safe, Martín D.; Stein, Maya (Elsevier, 2016)
      A set of vertices X of a graph G is convex if no shortest path between two vertices in X contains a vertex outside X. We prove that for fixed p >= 1, all partitions of the vertex set of a bipartite graph into p convex sets ...
    • Forbidden subgraphs and the König–Egerváry property 
      Bonomo, Flavia; Dourado, Mitre C.; Durán Maggiolo, Guillermo; Faria, Luerbio; Grippo, Luciano N.; Safe, Martín D. (Elsevier, 2013)
      The matching number of a graph is the maximum size of a set of vertex-disjoint edges. The transversal number is the minimum number of vertices needed to meet every edge. A graph has the König–Egerváry property if its ...
    • On minimal forbidden subgraph characterizations of balanced graphs 
      Bonomo, Flavia; Durán Maggiolo, Guillermo; Safe, Martín D.; Wagler, Annegret K. (2013)
      A graph is balanced if its clique-matrix contains no edge–vertex incidence matrix of an odd chordless cycle as a submatrix. While a forbidden induced subgraph characterization of balanced graphs is known, there is no ...
    • On some graph classes related to perfect graphs: A survey 
      Bonomo-Braberman, Flavia; Durán, Guillermo; Safe, Martín D.; Wagler, Annegret K. (Elsevier, 2020)
      Perfect graphs form a well-known class of graphs introduced by Berge in the 1960s in terms of a min-max type equality involving two famous graph parameters. In this work, we survey certain variants and subclasses of perfect ...
    • Structural results on circular-arc graphs and circle graphs: A survey and the main open problems 
      Durán Maggiolo, Guillermo; Grippo, Luciano N.; Safe, Martín D. (Elsevier, 2014)
      Circular-arc graphs are the intersection graphs of open arcs on a circle. Circle graphs are the intersection graphs of chords on a circle. These graph classes have been the subject of much study for many years and numerous ...