On hypochordal graphs
Marie-Christine Costa, Christophe Picouleau and Hélène Topart
2011
Publication type: research reports
Download: images/icons/doctype_pdf.gif   http://uma.ensta-paristech.fr/files/publis/2011/2011-rr-uma1133-HCJGAAAvril2011.pdf
Keywords : graph, connectivity, path, N P-complete

Abstract:
We introduce graphs called hypochordal: for any path of length 2, there exists a chord or another path of length 2 between its two endpoints. We show that such graphs are 2-vertex-connected and moreover in the case of an edge or a vertex deletion, the distance between any pair of nonadjacent vertices remains unchanged. We give properties of hypochordal graphs, then we study the class of minimum hypochordal graphs and finally we give some complexity results for classical combinatorial problems.

BibTeX
@techreport{Cos-Pic-Top-2011,
    author={Marie-Christine Costa and Christophe Picouleau and Hélène 
           Topart },
    title={On hypochordal graphs },
    year={2011 },
}