The complexity of B1-EPG-Helly graph recognition

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	1-24
Journal	Discrete Mathematics and Theoretical Computer Science
Volume	22
Issue number	1
State	Published - 2020

Cite this

@article{c06a5d9d8f7042169b24c5d0b062e5dd,

title = "The complexity of B1-EPG-Helly graph recognition",

author = "Bornstein, \{Claudson F.\} and Santos, \{Tanilson D.\} and Souza, \{Ue'verton S.\} and Szwarcfiter, \{Jayme L.\} and Martin Golumbic",

year = "2020",

language = "English",

volume = "22",

pages = "1--24",

journal = "Discrete Mathematics and Theoretical Computer Science",

issn = "1365-8050",

publisher = "Maison de l'informatique et des mathematiques discretes",

number = "1",

}

TY - JOUR

T1 - The complexity of B1-EPG-Helly graph recognition

AU - Bornstein, Claudson F.

AU - Santos, Tanilson D.

AU - Souza , Ue'verton S.

AU - Szwarcfiter, Jayme L.

AU - Golumbic, Martin

PY - 2020

Y1 - 2020

M3 - Article

SN - 1365-8050

VL - 22

SP - 1

EP - 24

JO - Discrete Mathematics and Theoretical Computer Science

JF - Discrete Mathematics and Theoretical Computer Science

IS - 1

ER -