scientific article; zbMATH DE number 4063153
From MaRDI portal
Publication:3797239
[For the entire collection see Zbl 0638.00009.] Bipartite permutation graphs are precisely those graphs which are both permutation graphs and bipartite graphs. We show that bipartite permutation graphs are equivalent to bipartite tolerance graphs, and describe the relationships among these graphs and a number of other families of bipartite graphs.
Recommendations
Cited in
(11)- Solving the weighted efficient edge domination problem on bipartite permutation graphs
- On the complexity of the k-chain subgraph cover problem
- Weighted efficient domination problem on some perfect graphs
- Tolerance orders and bipartite unit tolerance graphs
- Negative results on characterizing visibility graphs
- On strict (outer-)confluent graphs
- Bipartite Permutation Graphs Are Reconstructible
- Circularly compatible ones, D-circularity, and proper circular-arc bigraphs
- On the complexity of the maximum biplanar subgraph problem
- Visibility graphs of towers
- Domination in convex and chordal bipartite graphs
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)