A new characterization of strongly chordal graphs (Q1301851): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Sergei L. Bezrukov / rank | |||
Property / reviewed by | |||
Property / reviewed by: Sergei L. Bezrukov / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterizations of strongly chordal graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Topics in Intersection Graph Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4288086 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3980562 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 22:30, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new characterization of strongly chordal graphs |
scientific article |
Statements
A new characterization of strongly chordal graphs (English)
0 references
15 August 2000
0 references
Define the strength of a set of edges as the number of inclusion-maximal complete subgraphs that contain it. The main result is that a graph is strongly chordal if and only if, for every \(k\geq 1\), every cycle of edges of strength at least \(k\) with no chord of strength at least \(k\) itself has strength at least \(k\). This approach being applied to the hereditary clique-Helly graphs provides that such a graph is strongly chordal if and only if, for every \(k\), the edges of strength at least \(k\) form a chordal graph.
0 references
chordal graphs
0 references