C. Bornstein

activity

20152019

B_{1}

EPG Graph Recognition

6 citations · 6 across the 2 of their papers we have counts for

collaborators

3 papers

cs.DM2019★ 6 cited

The Complexity of Helly- $B_{1}$ EPG Graph Recognition

Claudson F. Bornstein, Martin Charles Golumbic, Tanilson D. Santos +2

Golumbic, Lipshteyn, and Stern defined in 2009 the class of EPG graphs, the intersection graph class of edge paths on a grid. An EPG graph $G$ is a graph that admits a representati…

math.CO2017

Constant Threshold Intersection Graphs of Orthodox Paths in Trees

Claudson Ferreira Bornstein, José Wilson Coura Pinto, Dieter Rautenbach +1

A graph $G$ belongs to the class $ORTH [h, s, t]$ for integers $h$ , $s$ , and $t$ if there is a pair $(T, S)$ , where $T$ is a tree of maximum degree at most $h$ , and ${\cal…

math.CO2015

Forbidden Induced Subgraphs for Bounded $p$ -Intersection Number

Claudson F. Bornstein, Jose W. C. Pinto, Dieter Rautenbach +1

A graph $G$ has $p$ -intersection number at most $d$ if it is possible to assign to every vertex $u$ of $G$ , a subset $S (u)$ of some ground set $U$ with $∣ U ∣ = d$ in such a way that d…

The Complexity of Helly-B1​ EPG Graph Recognition

Constant Threshold Intersection Graphs of Orthodox Paths in Trees

Forbidden Induced Subgraphs for Bounded p-Intersection Number

The Complexity of Helly- $B_{1}$ EPG Graph Recognition

Forbidden Induced Subgraphs for Bounded $p$ -Intersection Number