Polar permutation graphs are polynomial-time recognisable (Q1933641)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polar permutation graphs are polynomial-time recognisable |
scientific article |
Statements
Polar permutation graphs are polynomial-time recognisable (English)
0 references
24 January 2013
0 references
bipartite graphs
0 references
cobipartite graphs
0 references
split graphs
0 references
matrix partitions
0 references
