Bonomo, Flavia Mazzoleni, Maria Pia Rean, Mariano Leonardo Ries, Bernard 2018 A graph G is a Bo- VPG graph if it is the vertex intersection graph of horizontal and vertical paths on a grid. A graph G is a contact Bo- 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 Bo-VPG graphs within the class of chordal graphs and provide a polynomial-time algorithm for recognising these graphs. application/pdf https://folia.unifr.ch/global/documents/307913 https://folia.unifr.ch/documents/307913/files/isco2018_rero.pdf eng info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-319-96151-4_8 info:eu-repo/semantics/openAccess License undefined Lecture Notes in Computer Science. - 2018, vol. 10856, p. 89-100 Vertex intersection graphs Contact Bo-VPG graph Forbidden induced subgraphs Chordal graphs Polynomial-time algorithm info:eu-repo/classification/udc/004 Characterising Chordal Contact : Bo-VPG Graphs http://purl.org/coar/resource_type/c_6501