Precedence thinness in graphs (Q2091785)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7610733
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Precedence thinness in graphs |
scientific article; zbMATH DE number 7610733 |
Statements
Precedence thinness in graphs (English)
0 references
2 November 2022
0 references
(proper) \(k\)-thin graphs
0 references
precedence (proper) \(k\)-thin graphs
0 references
recognition algorithm
0 references
characterization
0 references
threshold graphs
0 references
0 references
0 references
0.85351044
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.82103425
0 references
