On the complexity of role colouring planar graphs, trees and cographs (Q891815)
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 role colouring planar graphs, trees and cographs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of role colouring planar graphs, trees and cographs |
scientific article |
Statements
On the complexity of role colouring planar graphs, trees and cographs (English)
0 references
17 November 2015
0 references
role colouring
0 references
regular equivalence
0 references
locally surjective homomorphism
0 references
complexity
0 references
planar graph
0 references
tree
0 references
cograph
0 references
0.823172926902771
0 references
0.8121745586395264
0 references
0.8098570108413696
0 references
0.7968399524688721
0 references
0.7918009161949158
0 references
