scientific article; zbMATH DE number 969165

MaRDI QIDQ5284636zbMATH OpenFDO

Authors Frédéric Maire

Publication date 31 August 1997

zbMATH Keywords

algorithmschordal graphsperfect graphstriangulated graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Recommendations

• Slightly triangulated graphs are perfect
• Optimizing weakly triangulated graphs
• On hyper-chordal graphs
• Algorithms for weakly triangulated graphs
• scientific article; zbMATH DE number 3888924

Cited in

(4)

• scientific article; zbMATH DE number 6873974 (Why is no real title available?)
• Triangulating planar graphs while minimizing the maximum degree
• Optimizing weakly triangulated graphs
• On hyper-chordal graphs

This page was built for publication:

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