Meyniel weakly triangulated graphs II: A theorem of Dirac

doi:10.1016/S0166-218X(97)00058-9

Discrete Applied Mathematics

Volume 78, Issues 1–3, 21 October 1997, Pages 283-289

https://doi.org/10.1016/S0166-218X(97)00058-9 Get rights and content

Under an Elsevier user license

open archive

Abstract

We generalize a theorem due to Dirac and show that every Meyniel weakly triangulated graph has some vertex which is not the middle vertex of any P₅. Our main tool is a separating set notion known as a handle.

Keywords

Weakly triangulated graph

Meyniel graph

Handle

Cited by (0)

^☆: This research was supported by NSERC Operating Grant OGP-0137764.

Discrete Applied Mathematics

NoteMeyniel weakly triangulated graphs II: A theorem of Dirac☆

Abstract

Keywords

Note
Meyniel weakly triangulated graphs II: A theorem of Dirac☆