No label defined (Q3974827)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 17505
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 17505 |
Statements
26 June 1992
0 references
strongly chordal graphs
0 references
separator hypergraph
0 references
algorithm
0 references
minimal relative separators
0 references
0.868710458278656
0 references
0.8175199627876282
0 references
0.8032333850860596
0 references
0.7958215475082397
0 references
0.7922803163528442
0 references
[For the entire collection see Zbl 0726.00009.] We characterize strongly chordal graphs by minimal relative separators. We show that a graph \(G\) is strongly chordal if and only if \(G\) is chordal and the minimal relative separator hypergraph of \(G\) is totally balanced. An algorithm to find all the minimal relative separators of a chordal graph is also given.
0 references
