On hyper-chordal graphs

DOI10.37193/CJM.2021.01.12MaRDI QIDQ3384561zbMATH OpenWikidataFDO

Authors Mihai Talmaciu

Publication date 15 December 2021

Published in Carpathian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37193/CJM.2021.01.12

zbMATH Keywords

chordal graphshyper-chordal graphsrecognition algorithmweak decomposition

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Recommendations

• Weakly triangulated graphs
• Generalizations of triangulated graphs
• scientific article; zbMATH DE number 969165
• Chordal digraphs
• More characterizations of triangulated graphs

Cited in

(6)

• scientific article; zbMATH DE number 1533810 (Why is no real title available?)
• Generalizations of triangulated graphs
• A class of hypergraphs that generalizes chordal graphs
• scientific article; zbMATH DE number 969165 (Why is no real title available?)
• More characterizations of triangulated graphs
• A Note on Quasi‐triangulated Graphs

This page was built for publication: On hyper-chordal graphs

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