scientific article; zbMATH DE number 4063153
From MaRDI portal
Publication:3797239
zbMATH Open0652.05060MaRDI QIDQ3797239FDOQ3797239
Andreas Brandstädt, Lorna Stewart, Jeremy P. Spinrad
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
Cited In (11)
- Bipartite Permutation Graphs Are Reconstructible
- On strict (outer-)confluent graphs
- Negative results on characterizing visibility graphs
- On the complexity of the k-chain subgraph cover problem
- Domination in convex and chordal bipartite graphs
- Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs
- Solving the weighted efficient edge domination problem on bipartite permutation graphs
- Weighted efficient domination problem on some perfect graphs
- Tolerance orders and bipartite unit tolerance graphs
- On the complexity of the maximum biplanar subgraph problem
- Visibility graphs of towers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3797239)