Finite orders which are reconstructible up to duality by their comparability graphs (Q1988547): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s40840-019-00805-w / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2961760053 / rank | |||
Normal rank | |||
Revision as of 23:12, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finite orders which are reconstructible up to duality by their comparability graphs |
scientific article |
Statements
Finite orders which are reconstructible up to duality by their comparability graphs (English)
0 references
23 April 2020
0 references
ordered set
0 references
comparability graph
0 references
reconstruction
0 references
isomorphism up to duality
0 references
modular decomposition
0 references
