scientific article; zbMATH DE number 4063153

zbMATH Open0652.05060MaRDI QIDQ3797239FDOQ3797239

Authors: Andreas Brandstädt, Jeremy P. Spinrad, Lorna Stewart 

Publication date: 1987

Title of this publication is not available (Why is that?)

Recommendations

• Bipartite permutation graphs
• Publication:4862906
• scientific article; zbMATH DE number 1156661
• Double-threshold permutation graphs
• Recognizing Bipartite Tolerance Graphs in Linear Time

zbMATH Keywords

bipartite graphsBipartite permutation graphsbipartite tolerance graphs

Mathematics Subject Classification ID

Graph theory (05C99)

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
• 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
• Circularly compatible ones, \(D\)-circularity, and proper circular-arc bigraphs
• 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)