Proper circular arc graphs as intersection graphs of pathson a grid

Autores
Galby, Esther; Mazzoleni, María Pía; Ries, Bernard
Año de publicación
2019
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
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).
Facultad de Ciencias Exactas
Materia
Matemática
Forbidden induced subgraph
Intersection graph
Bk-EPG graph
Proper circular arc graph
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/127879
Acceder
id SEDICI_b6f6da30431439a1d02ae027d036e722
oai_identifier_str oai:sedici.unlp.edu.ar:10915/127879
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Proper circular arc graphs as intersection graphs of pathson a gridGalby, EstherMazzoleni, María PíaRies, BernardMatemáticaForbidden induced subgraphIntersection graphBk-EPG graphProper circular arc graphIn 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).Facultad de Ciencias Exactas2019info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf195-202http://sedici.unlp.edu.ar/handle/10915/127879enginfo:eu-repo/semantics/altIdentifier/issn/0166-218Xinfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2019.02.010info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T11:03:04Zoai:sedici.unlp.edu.ar:10915/127879Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 11:03:04.653SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Proper circular arc graphs as intersection graphs of pathson a grid
title Proper circular arc graphs as intersection graphs of pathson a grid
spellingShingle Proper circular arc graphs as intersection graphs of pathson a grid
Galby, Esther
Matemática
Forbidden induced subgraph
Intersection graph
Bk-EPG graph
Proper circular arc graph
title_short Proper circular arc graphs as intersection graphs of pathson a grid
title_full Proper circular arc graphs as intersection graphs of pathson a grid
title_fullStr Proper circular arc graphs as intersection graphs of pathson a grid
title_full_unstemmed Proper circular arc graphs as intersection graphs of pathson a grid
title_sort Proper circular arc graphs as intersection graphs of pathson a grid
dc.creator.none.fl_str_mv Galby, Esther
Mazzoleni, María Pía
Ries, Bernard
author Galby, Esther
author_facet Galby, Esther
Mazzoleni, María Pía
Ries, Bernard
author_role author
author2 Mazzoleni, María Pía
Ries, Bernard
author2_role author
author
dc.subject.none.fl_str_mv Matemática
Forbidden induced subgraph
Intersection graph
Bk-EPG graph
Proper circular arc graph
topic Matemática
Forbidden induced subgraph
Intersection graph
Bk-EPG graph
Proper circular arc graph
dc.description.none.fl_txt_mv 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).
Facultad de Ciencias Exactas
description 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).
publishDate 2019
dc.date.none.fl_str_mv 2019
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Articulo
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/127879
url http://sedici.unlp.edu.ar/handle/10915/127879
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/0166-218X
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2019.02.010
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
195-202
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1842260529381376000
score 13.13397

Publicaciones similares