On the complexity of path problems in properly colored directed graphs (Q1928492)
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: On the complexity of path problems in properly colored directed graphs |
scientific article; zbMATH DE number 6121547
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of path problems in properly colored directed graphs |
scientific article; zbMATH DE number 6121547 |
Statements
On the complexity of path problems in properly colored directed graphs (English)
0 references
3 January 2013
0 references
graph coloring
0 references
complexity
0 references
chromatic number
0 references
longest path
0 references
shortest path
0 references
