Classes of graphs critical for the edge list-ranking problem (Q5264719)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Classes of graphs critical for the edge list-ranking problem |
scientific article; zbMATH DE number 6466077
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Classes of graphs critical for the edge list-ranking problem |
scientific article; zbMATH DE number 6466077 |
Statements
Classes of graphs critical for the edge list-ranking problem (English)
0 references
27 July 2015
0 references
computational complexity
0 references
hereditary class
0 references
boundary class
0 references
minimal hard class
0 references
polynomial algorithm
0 references
edge list-ranking problem
0 references
