Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)] (Q1813714): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimizing weakly triangulated graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Weakly triangulated graphs / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:06, 14 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)] |
scientific article |
Statements
Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)] (English)
0 references
25 June 1992
0 references
Due to a oversight on the part of the authors, the proof given in \textit{R. Hayward}, \textit{C. Hoang} and \textit{F. Maffray} [Graphs Comb. 5(4), 339-349 (1989; Zbl 0679.68082)] for the \(WT\) two-pair theorem is incomplete, and should be replaced with the proof given here.
0 references
