dc.creatorBonomo, Flavia
dc.creatorGalby, Esther
dc.creatorGonzález, Carolina Lucía
dc.date.accessioned2021-10-15T17:37:04Z
dc.date.accessioned2022-10-15T07:30:54Z
dc.date.available2021-10-15T17:37:04Z
dc.date.available2022-10-15T07:30:54Z
dc.date.created2021-10-15T17:37:04Z
dc.date.issued2020-09
dc.identifierBonomo, Flavia; Galby, Esther; González, Carolina Lucía; Characterising circular-arc contact B0–VPG graphs; Elsevier Science; Discrete Applied Mathematics; 283; 9-2020; 435-443
dc.identifier0166-218X
dc.identifierhttp://hdl.handle.net/11336/143879
dc.identifierCONICET Digital
dc.identifierCONICET
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4360620
dc.description.abstractA contact B0–VPG graph is a graph for which there exists a collection of nontrivial pairwise interiorly disjoint horizontal and vertical segments in one-to-one correspondence with its vertex set such that two vertices are adjacent if and only if the corresponding segments touch. It was shown in Deniz et al. (2018) that RECOGNITION is NP-complete for contact B0–VPG graphs. In this paper we present a minimal forbidden induced subgraph characterisation of contact B0–VPG graphs within the class of circular-arc graphs and provide a polynomial-time algorithm for recognising these graphs.
dc.languageeng
dc.publisherElsevier Science
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.dam.2020.01.027
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/abs/pii/S0166218X20300445
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.rightsinfo:eu-repo/semantics/restrictedAccess
dc.subjectCIRCULAR-ARC GRAPHS
dc.subjectCONTACT B0-VPG
dc.subjectCONTACT GRAPHS OF PATHS ON A GRID
dc.titleCharacterising circular-arc contact B0–VPG graphs
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:ar-repo/semantics/artículo
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución