Results 71 to 72 of about 1,883 (72)
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
, 2015 Golumbic, Lipshteyn and Stern \cite{Golumbic-epg} 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 rectangular grid such
Alcón, L. +6 more
core
Limited packings of closed neighbourhoods in graphs
, 2015 The k-limited packing number, $L_k(G)$, of a graph $G$, introduced by Gallant, Gunther, Hartnell, and Rall, is the maximum cardinality of a set $X$ of vertices of $G$ such that every vertex of $G$ has at most $k$ elements of $X$ in its closed ...
Balister, Paul N. +2 more
core