More characterizations of triangulated graphs

DOI10.1002/JGT.3190140404MaRDI QIDQ5752613zbMATH OpenOpenAlexFDO

Authors C. Benzaken, Pierre Duchet, Peter L. Hammer, Frédéric Maffray, Yves Crama

Publication date 1990

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190140404

zbMATH Keywords

Cotriangulated graphsstrongly perfect graphstriangulated graphs

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph theory (05C99)

Recommendations

• Weakly triangulated graphs
• On hyper-chordal graphs
• Slightly triangulated graphs are perfect
• scientific article; zbMATH DE number 4093506
• scientific article; zbMATH DE number 3914360

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• Shellable Decompositions of Cells and Spheres.

Cited in

(10)

• Regularity of powers of bipartite graphs
• Bounds for the regularity of product of edge ideals
• On strict (outer-)confluent graphs
• New characterizations of Gallai's \(i\)-triangulated graphs
• On hyper-chordal graphs
• scientific article; zbMATH DE number 3914360 (Why is no real title available?)
• On strict (outer-)confluent graphs
• scientific article; zbMATH DE number 6794321 (Why is no real title available?)
• Tree-shellability of Boolean functions
• Pseudo-Boolean optimization

This page was built for publication: More characterizations of triangulated graphs

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