Generalizations of triangulated graphs

MaRDI QIDQ4642246zbMATH OpenFDO

Authors Mihai Talmaciu

Publication date 22 May 2018

zbMATH Keywords

chordal graphsdoubly chordal graphsdually chordal graphshereditary dually chordal graphsrecognition algorithmstrongly chordal graphsweak decomposition

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Fast algorithms of hereditary doubly chordal graphs
• Fast algorithms of dually chordal graphs
• On hyper-chordal graphs
• Optimizing weakly triangulated graphs
• Doubly chordal graphs, steiner trees, and connected domination

Cited in

(11)

• Triangulating remnants of complete graphs
• Fast algorithms of dually chordal graphs
• Graph relations, clique divergence and surface triangulations
• On hyper-chordal graphs
• scientific article; zbMATH DE number 4158675 (Why is no real title available?)
• Testing Triangle-Freeness in General Graphs
• Fast algorithms of hereditary doubly chordal graphs
• Some graph theoretical aspects of generalized truncations
• Truly non-trivial graphoidal graphs
• The graphs that Dahlhaus called ``good generalized strongly chordal
• Trapezoid graphs and generalizations, geometry and algorithms

This page was built for publication: Generalizations of triangulated graphs

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