Two characterisations of the minimal triangulations of permutation graphs (Q390311): 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.1016/j.disc.2013.06.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2077491430 / rank | |||
Normal rank | |||
Revision as of 02:09, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two characterisations of the minimal triangulations of permutation graphs |
scientific article |
Statements
Two characterisations of the minimal triangulations of permutation graphs (English)
0 references
23 January 2014
0 references
permutation graphs
0 references
interval graphs
0 references
minimal triangulations
0 references
potential maximal cliques
0 references
characterisations
0 references
