Pages that link to "Item:Q2637346"
From MaRDI portal
The following pages link to On pairwise compatibility graphs having Dilworth number two (Q2637346):
Displayed 12 items.
- Corrigendum to: ``On pairwise compatibility graphs having Dilworth number two'' (Q497693) (← links)
- Algorithms for area-efficient orthogonal drawing (Q1384191) (← links)
- New results on pairwise compatibility graphs (Q2169428) (← links)
- On pairwise compatibility graphs having Dilworth number \(k\) (Q2253200) (← links)
- Some classes of graphs that are not PCGs (Q2272401) (← links)
- Some reduction operations to pairwise compatibility graphs (Q2338220) (← links)
- Pairwise compatibility graphs: complete characterization for wheels (Q2424298) (← links)
- On graphs that are not PCGs (Q2512661) (← links)
- Pairwise Compatibility Graphs: A Survey (Q3186100) (← links)
- A survey on pairwise compatibility graphs (Q5012383) (← links)
- Characterizing star-PCGs (Q5916258) (← links)
- The DFS-heuristic for orthogonal graph drawing (Q5943316) (← links)