The following pages link to (Q3797239):
Displaying 11 items.
- Visibility graphs of towers (Q676570) (← links)
- Domination in convex and chordal bipartite graphs (Q918703) (← links)
- Solving the weighted efficient edge domination problem on bipartite permutation graphs (Q1270782) (← links)
- On the complexity of the k-chain subgraph cover problem (Q1275070) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- Tolerance orders and bipartite unit tolerance graphs (Q1841895) (← links)
- Negative results on characterizing visibility graphs (Q1900990) (← links)
- On strict (outer-)confluent graphs (Q2206846) (← links)
- Bipartite Permutation Graphs Are Reconstructible (Q3066471) (← links)
- Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs (Q4986807) (← links)
- On the complexity of the maximum biplanar subgraph problem (Q5946290) (← links)