Properly colored connectivity of graphs (Q4636339)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6863927
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Properly colored connectivity of graphs |
scientific article; zbMATH DE number 6863927 |
Statements
Properly Colored Connectivity of Graphs (English)
0 references
23 April 2018
0 references
properly connected graphs
0 references
proper path coloring
0 references
proper connection number
0 references
strong proper connection
0 references
total proper connection
0 references
0.8064579367637634
0 references
0.803122878074646
0 references
0.7971478700637817
0 references
0.7948660254478455
0 references
0.7901249527931213
0 references