Browsing by Subject "Forbidden induced subgraphs"
Now showing items 1-3 of 3
-
(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 ...
-
(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 ...
-
(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, ...