An on-line competitive algorithm for coloring bipartite graphs without long induced paths (Q524365)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An on-line competitive algorithm for coloring bipartite graphs without long induced paths |
scientific article |
Statements
An on-line competitive algorithm for coloring bipartite graphs without long induced paths (English)
0 references
2 May 2017
0 references
on-line algorithm
0 references
graph coloring
0 references
bipartite graphs
0 references
