Meyniel weakly triangulated graphs II: A theorem of Dirac

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 P5. Our main tool is a separating set notion known as a handle.