Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)]

DOI10.1007/BF01787477zbMath0744.68108MaRDI QIDQ1813714

Yanyan Li

Publication date: 25 June 1992

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (13)

Algorithms for weakly triangulated graphs ⋮ Path parity and perfection ⋮ Powers of distance-hereditary graphs ⋮ On edge perfectness and classes of bipartite graphs ⋮ Some properties of minimal imperfect graphs ⋮ New graph classes characterized by weak vertex separators and two-pairs ⋮ Homogeneously orderable graphs ⋮ On 3-degree 4-chordal graphs ⋮ Counterexamples to three conjectures concerning perfect graphs ⋮ Transitive orientations in bull-reducible Berge graphs ⋮ Neighborhood subtree tolerance graphs ⋮ Maximum weight independent sets in hole- and co-chair-free graphs ⋮ Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds

Cites Work

• Weakly triangulated graphs
• Optimizing weakly triangulated graphs

This page was built for publication: Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)]