scientific article

zbMath0972.68126MaRDI QIDQ2708230

Pinar Heggernes, Anne Berry, Jean-Paul Bordat

Publication date: 17 April 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

recognition algorithmweakly triangulated graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (15)

A vertex incremental approach for maintaining chordality ⋮ Chordal probe graphs ⋮ Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2 ⋮ On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators ⋮ What Is between Chordal and Weakly Chordal Graphs? ⋮ Graph extremities defined by search algorithms ⋮ Generating weakly chordal graphs from arbitrary graphs ⋮ Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs ⋮ Maximum weight independent sets in odd-hole-free graphs without dart or without bull ⋮ On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem ⋮ Representing edge intersection graphs of paths on degree 4 trees ⋮ Minimal separators in extended \(P_4\)-laden graphs ⋮ Maximal sub-triangulation in pre-processing phylogenetic data ⋮ Maximum weight independent sets in hole- and co-chair-free graphs ⋮ Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds

This page was built for publication: