scientific article; zbMATH DE number 1445284

zbMath0956.68104MaRDI QIDQ4952597

R. Sritharan, Ryan B. Hayward, Jeremy P. Spinrad

Publication date: 10 May 2000

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

zbMATH Keywords

handleweakly chordal graphs

Mathematics Subject Classification ID

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

Related Items (19)

A vertex incremental approach for maintaining chordality ⋮ Chordal probe graphs ⋮ Unnamed Item ⋮ Finding clubs in graph classes ⋮ Some algorithmic results for eternal vertex cover problem in graphs ⋮ On the kernel and related problems in interval digraphs ⋮ On 3-degree 4-chordal graphs ⋮ Classes of perfect graphs ⋮ A min-max property of chordal bipartite graphs with applications ⋮ Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs ⋮ Sum-perfect graphs ⋮ A new characterization of HH-free graphs ⋮ On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem ⋮ Representing edge intersection graphs of paths on degree 4 trees ⋮ The induced matching and chain subgraph cover problems for convex bipartite graphs ⋮ Finding a maximum induced matching in weakly chordal graphs ⋮ Coloring Artemis graphs ⋮ Maximum weight independent sets in hole- and co-chair-free graphs ⋮ Independent packings in structured graphs

This page was built for publication: