On hypochordal graphs - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2010

On hypochordal graphs

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. Keywords: graph, tree, vertex-connected, N P-complete
No file

Dates and versions

hal-01125743 , version 1 (06-03-2015)

Identifiers

  • HAL Id : hal-01125743 , version 1

Cite

Marie-Christine Costa, Christophe Picouleau, Hélène Topart. On hypochordal graphs. [Research Report] CEDRIC-10-1886, CEDRIC Lab/CNAM. 2010. ⟨hal-01125743⟩
38 View
0 Download

Share

Gmail Facebook X LinkedIn More