Single bend paths on a grid have strong helly number 4: Errata atque emendationes ad "edge intersection graphs of single bend paths on a grid"

Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Research output: Contribution to journalArticlepeer-review

Abstract

In this note, we prove that a collection of single bend paths on a grid, the so-called B1 representations, have strong Helly number 4. This corrects a false claim from Ref. [Golumbic et al., Networks, 54 (2009), 130-138; and other errata are also corrected.

Original languageEnglish
Pages (from-to)161-163
Number of pages3
JournalNetworks
Volume62
Issue number2
DOIs
StatePublished - Sep 2013

Keywords

  • B -EPG graphs
  • intersecting paths on a grid
  • intersection graphs
  • strong Helly number

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Single bend paths on a grid have strong helly number 4: Errata atque emendationes ad "edge intersection graphs of single bend paths on a grid"'. Together they form a unique fingerprint.

Cite this