Grundy coloring in some subclasses of bipartite graphs and their complements (Q2203596)
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 7256106
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Grundy coloring in some subclasses of bipartite graphs and their complements |
scientific article; zbMATH DE number 7256106 |
Statements
Grundy coloring in some subclasses of bipartite graphs and their complements (English)
0 references
7 October 2020
0 references
graph algorithms
0 references
Grundy coloring
0 references
partial Grundy coloring
0 references
NP-completeness
0 references
polynomial time algorithms
0 references
0.95243907
0 references
0.93304086
0 references
0.9303646
0 references
0.9200673
0 references
0.9170381
0 references
0.9150292
0 references
0.90915465
0 references
