Navegar

Colección

Datos Estadísticas

Artículo

Bonomo, F.; Mazzoleni, M.P.; Rean, M.L.; Ries, B.; Rinaldi G.; Mahjoub A.R.; Lee J. "Characterising Chordal ContactB0-VPG Graphs" (2018) 5th International Symposium on Combinatorial Optimization, ISCO 2018. 10856 LNCS:89-100
El editor solo permite decargar el artículo en su versión post-print desde el repositorio. Por favor, si usted posee dicha versión, enviela a
Consulte el artículo en la página del editor
Consulte la política de Acceso Abierto del editor

Abstract:

A graph G is a B0-VPG graph if it is the vertex intersection graph of horizontal and vertical paths on a grid. A graph G is a contact B0-VPG graph if the vertices can be represented by interiorly disjoint horizontal or vertical paths on a grid and two vertices are adjacent if and only if the corresponding paths touch. In this paper, we present a minimal forbidden induced subgraph characterisation of contact B0-VPG graphs within the class of chordal graphs and provide a polynomial-time algorithm for recognising these graphs. © 2018, Springer International Publishing AG, part of Springer Nature.

Registro:

Documento: Artículo
Título:Characterising Chordal ContactB0-VPG Graphs
Autor:Bonomo, F.; Mazzoleni, M.P.; Rean, M.L.; Ries, B.; Rinaldi G.; Mahjoub A.R.; Lee J.
Filiación:Facultad de Ciencias Exactas y Naturales, Departamento de Computación, Universidad de Buenos Aires, Buenos Aires, Argentina
Instituto de Investigación en Ciencias de la Computación (ICC), CONICET-Universidad de Buenos Aires, Buenos Aires, Argentina
Facultad de Ciencias Exactas, Departamento de Matemática, Univesidad Nacional de La Plata, La Plata, Argentina
CONICET, Buenos Aires, Argentina
University of Fribourg, Fribourg, Switzerland
Palabras clave:Chordal graphs; Contact B0-VPG graphs; Forbidden induced subgraphs; Polynomial-time algorithm; Vertex intersection graphs; Combinatorial optimization; Graphic methods; Polynomial approximation; Chordal graphs; Forbidden induced subgraphs; Graph G; Induced subgraphs; Intersection graph; Polynomial-time algorithms; Graph theory
Año:2018
Volumen:10856 LNCS
Página de inicio:89
Página de fin:100
DOI: http://dx.doi.org/10.1007/978-3-319-96151-4_8
Título revista:5th International Symposium on Combinatorial Optimization, ISCO 2018
Título revista abreviado:Lect. Notes Comput. Sci.
ISSN:03029743
Registro:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v10856LNCS_n_p89_Bonomo

Referencias:

  • Alcón, L., Bonomo, F., Mazzoleni, M.P., Vertex intersection graphs of paths on a grid: Characterization within block graphs (2017) Graphs Comb, 33 (4), pp. 653-664
  • Asinowski, A., Cohen, E., Golumbic, M., Limouzy, V., Lipshteyn, M., Stern, M., Vertex intersection graphs of paths on a grid (2012) J. Graph Algorithms Appl., 16, pp. 129-150
  • Bondy, J.A., Murty, U.S.R., (2007) Graph Theory, , Springer, New York
  • Chaplick, S., Cohen, E., Stacho, J., Recognizing some subclasses of vertex intersection graphs of 0-Bend paths in a grid (2011) WG 2011. LNCS, 6986, pp. 319-330. , https://doi.org/10.1007/978-3-642-25870-1-29, Kolman, P., Kratochvíl, J. (eds.), Springer, Heidelberg
  • Chaplick, S., Ueckerdt, T., Planar graphs as VPG-graphs (2013) J. Graph Algorithms Appl., 17 (4), pp. 475-494
  • Cohen, E., Golumbic, M.C., Ries, B., Characterizations of cographs as intersection graphs of paths on a grid (2014) Discrete Appl. Math., 178, pp. 46-57
  • Cohen, E., Golumbic, M.C., Trotter, W.T., Wang, R., Posets and VPG graphs (2016) Order, 33 (1), pp. 39-49
  • Felsner, S., Knauer, K., Mertzios, G.B., Ueckerdt, T., Intersection graphs of L-shapes and segments in the plane (2016) Discrete Appl. Math., 206, pp. 48-55
  • de Fraysseix, H., Ossona de Mendez, P., Pach, J., Representation of planar graphs by segments (1991) Intuitive Geom, 63, pp. 109-117
  • Galinier, P., Habib, M., Paul, C., Chordal graphs and their clique graphs (1995) WG 1995. LNCS, 1017, pp. 358-371. , https://doi.org/10.1007/3-540-60618-188, Nagl, M. (ed.), Springer, Heidelberg
  • Golumbic, M.C., Ries, B., On the intersection graphs of orthogonal line segments in the plane: Characterizations of some subclasses of chordal graphs (2013) Graphs Comb, 29 (3), pp. 499-517
  • Gonçalves, D., Insenmann, L., Pennarum, C., (2017) Planar Graphs as L-Intersection Or L-Contact Graphs
  • Nieke, A., Felsner, S., Vertex contact representations of paths on a grid (2015) J. Graph Algorithms Appl., 19 (3), pp. 817-849A4 -

Citas:

---------- APA ----------
Bonomo, F., Mazzoleni, M.P., Rean, M.L., Ries, B., Rinaldi G., Mahjoub A.R. & Lee J. (2018) . Characterising Chordal ContactB0-VPG Graphs. 5th International Symposium on Combinatorial Optimization, ISCO 2018, 10856 LNCS, 89-100.
http://dx.doi.org/10.1007/978-3-319-96151-4_8
---------- CHICAGO ----------
Bonomo, F., Mazzoleni, M.P., Rean, M.L., Ries, B., Rinaldi G., Mahjoub A.R., et al. "Characterising Chordal ContactB0-VPG Graphs" . 5th International Symposium on Combinatorial Optimization, ISCO 2018 10856 LNCS (2018) : 89-100.
http://dx.doi.org/10.1007/978-3-319-96151-4_8
---------- MLA ----------
Bonomo, F., Mazzoleni, M.P., Rean, M.L., Ries, B., Rinaldi G., Mahjoub A.R., et al. "Characterising Chordal ContactB0-VPG Graphs" . 5th International Symposium on Combinatorial Optimization, ISCO 2018, vol. 10856 LNCS, 2018, pp. 89-100.
http://dx.doi.org/10.1007/978-3-319-96151-4_8
---------- VANCOUVER ----------
Bonomo, F., Mazzoleni, M.P., Rean, M.L., Ries, B., Rinaldi G., Mahjoub A.R., et al. Characterising Chordal ContactB0-VPG Graphs. Lect. Notes Comput. Sci. 2018;10856 LNCS:89-100.
http://dx.doi.org/10.1007/978-3-319-96151-4_8