scientific article; zbMATH DE number 4063153

MaRDI QIDQ3797239zbMATHFDO

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

Publication date 1987

zbMATH Keywords

bipartite graphsBipartite permutation graphsbipartite tolerance graphs

Mathematics Subject Classification ID

Graph theory (05C99)

Recommendations

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

Cited in

(11)

• On strict (outer-)confluent graphs
• Solving the weighted efficient edge domination problem on bipartite permutation graphs
• Bipartite Permutation Graphs Are Reconstructible
• On the complexity of the maximum biplanar subgraph problem
• Tolerance orders and bipartite unit tolerance graphs
• Visibility graphs of towers
• On the complexity of the k-chain subgraph cover problem
• Domination in convex and chordal bipartite graphs
• Weighted efficient domination problem on some perfect graphs
• Negative results on characterizing visibility graphs
• Circularly compatible ones, \(D\)-circularity, and proper circular-arc bigraphs

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)