Meyniel weakly triangulated graphs. II: A theorem of Dirac

DOI10.1016/S0166-218X(97)00058-9MaRDI QIDQ1377671zbMATH OpenFDO

Authors Ryan 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

handleMeyniel weakly triangulated graphtheorem of Dirac

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• Weakly triangulated graphs
• scientific article; zbMATH DE number 3884201
• Separability generalizes Dirac's theorem
• Generating weakly triangulated graphs

Cites work

• A characterization of some graph classes with no long holes
• A charming class of perfectly orderable graphs
• Characterizations of totally balanced matrices
• Doubly Lexical Orderings of Matrices
• scientific article; zbMATH DE number 3683635 (Why is no real title available?)
• On brittle graphs
• On rigid circuit graphs
• On the perfect graph conjecture
• Weakly triangulated graphs

Cited in

(2)

• Coloring Artemis graphs
• Separability generalizes Dirac's theorem

This page was built for publication: Meyniel weakly triangulated graphs. II: A theorem of Dirac

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377671)