English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we are interested in the edge intersection graphs of paths ofa grid where each path has at most one bend, called B1-EPG graphs and firstintroduced by Golumbic et al (2009). We also consider a proper subclass ofB1-EPG, the L-EPG graphs, which allows paths only in ``L'' shape. We show thattwo superclasses of trees are B1-EPG (one of them being the cactus graphs). Onthe other hand, we show that the block graphs are L-EPG and provide a lineartime algorithm to produce L-EPG representations of generalization of trees.These proofs employed a new technique from previous results in the area basedon block-cutpoint trees of the respective graphs.

B1-EPG representations using block-cutpoint trees