Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs (Q427574)
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: Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs |
scientific article; zbMATH DE number 6046279
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs |
scientific article; zbMATH DE number 6046279 |
Statements
Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs (English)
0 references
14 June 2012
0 references
rainbow connection number
0 references
rainbow coloring
0 references
maximal outerplanar graph
0 references
maximal cardinality search
0 references
0.8808701038360596
0 references
0.8803560733795166
0 references
0.8647035360336304
0 references
0.8480324149131775
0 references
