Pages that link to "Item:Q1813714"
From MaRDI portal
The following pages link to Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)] (Q1813714):
Displaying 13 items.
- Transitive orientations in bull-reducible Berge graphs (Q531595) (← links)
- Counterexamples to three conjectures concerning perfect graphs (Q686172) (← links)
- Maximum weight independent sets in hole- and co-chair-free graphs (Q763494) (← links)
- Some properties of minimal imperfect graphs (Q1126292) (← links)
- Path parity and perfection (Q1356748) (← links)
- Homogeneously orderable graphs (Q1392023) (← links)
- Neighborhood subtree tolerance graphs (Q1801665) (← links)
- Algorithms for weakly triangulated graphs (Q1891926) (← links)
- Powers of distance-hereditary graphs (Q1901030) (← links)
- On edge perfectness and classes of bipartite graphs (Q1910576) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- New graph classes characterized by weak vertex separators and two-pairs (Q2409764) (← links)
- On 3-degree 4-chordal graphs (Q6174132) (← links)
