An on-line competitive algorithm for coloring bipartite graphs without long induced paths (Q524365)
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: An on-line competitive algorithm for coloring bipartite graphs without long induced paths |
scientific article; zbMATH DE number 6710368
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An on-line competitive algorithm for coloring bipartite graphs without long induced paths |
scientific article; zbMATH DE number 6710368 |
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
