Busque entre los 157043 recursos disponibles en el repositorio
Mostrar el registro sencillo del ítem
dc.date.accessioned | 2021-11-08T15:46:23Z | |
dc.date.available | 2021-11-08T15:46:23Z | |
dc.date.issued | 2019 | |
dc.identifier.uri | http://sedici.unlp.edu.ar/handle/10915/127879 | |
dc.description.abstract | In this paper we present a characterization, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn). | en |
dc.format.extent | 195-202 | es |
dc.language | en | es |
dc.subject | Forbidden induced subgraph | es |
dc.subject | Intersection graph | es |
dc.subject | Bk-EPG graph | es |
dc.subject | Proper circular arc graph | es |
dc.title | Proper circular arc graphs as intersection graphs of pathson a grid | en |
dc.type | Articulo | es |
sedici.identifier.other | doi:10.1016/j.dam.2019.02.010 | es |
sedici.identifier.issn | 0166-218X | es |
sedici.creator.person | Galby, Esther | es |
sedici.creator.person | Mazzoleni, María Pía | es |
sedici.creator.person | Ries, Bernard | es |
sedici.subject.materias | Matemática | es |
sedici.description.fulltext | true | es |
mods.originInfo.place | Facultad de Ciencias Exactas | es |
sedici.subtype | Articulo | es |
sedici.rights.license | Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) | |
sedici.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | |
sedici.description.peerReview | peer-review | es |
sedici.relation.journalTitle | Discrete Applied Mathematics | es |
sedici.relation.journalVolumeAndIssue | vol. 262 | es |