Hélène Topart

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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(More)
  • 1