Meyniel weakly triangulated graphs. II: A theorem of Dirac

DOI10.1016/S0166-218X(97)00058-9zbMath0885.05080MaRDI QIDQ1377671

Ryan B. Hayward

Publication date: 26 January 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

handletheorem of DiracMeyniel weakly triangulated graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items

Separability generalizes Dirac's theorem ⋮ Coloring Artemis graphs

Cites Work

• Unnamed Item
• On rigid circuit graphs
• Weakly triangulated graphs
• A charming class of perfectly orderable graphs
• On the perfect graph conjecture
• A characterization of some graph classes with no long holes
• Characterizations of totally balanced matrices
• Doubly Lexical Orderings of Matrices
• On brittle graphs