Browsing by Subject "Forbidden induced subgraphs"

Now showing items 1-3 of 3

    • Neighborhood covering and independence on P4-tidy graphs and tree-cographs 
      Durán, Guillermo; Safe, Martín; Warnes, Xavier (Springer, 2020)
      Given a simple graph G, a set C subset of V(G)\documentclass[12pt] is a neighborhood cover set if every edge and vertex of G belongs to some G[v] with v is an element of C\documentclass[12pt] denotes the subgraph of G ...
    • On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid 
      Alcón, Liliana; Bonomo, Flavia; Durán, Guillermo; Gutierrez, Marisa; Mazzoleni, María; Ries, Bernard; Valencia-Pabon, Mario (Elsevier B.V., 2018)
      Golumbic, Lipshteyn and Stern [12] proved that every graph can be represented as the edge intersection graph of paths on a grid (EPG graph), i.e., one can associate with each vertex of the graph a nontrivial path on a ...
    • Recognition and characterization of unit interval graphs with integer endpoints 
      Durán, G.; Fernández Slezak, F.; Grippo, L. N.; Oliveira, F. de S.; Szwarcfiter, J. L. (Elsevier, 2018-08-20)
      We study those unit interval graphs having a model with intervals of integer endpoints and prescribed length. We present a structural result for this graph subclass which leads to a quadratic-time recognition algorithm, ...