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

DOI10.1007/BF01787477MaRDI QIDQ1813714zbMATH OpenFDO

Authors 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)

Recommendations

• Corrigendum to ``Graphs and digraphs with all 2-factors isomorphic [J. Combin. Theory Ser. B 92 (2) (2004) 395-404]
• scientific article; zbMATH DE number 5077174
• Weakly triangulated graphs
• Optimizing weakly triangulated graphs
• From conjecture to theorem

Cites work

• Optimizing weakly triangulated graphs
• Weakly triangulated graphs

Cited in

(14)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1813714)