On two conjectures about the proper connection number of graphs (Q2359964)
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 6735154
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On two conjectures about the proper connection number of graphs |
scientific article; zbMATH DE number 6735154 |
Statements
On two conjectures about the proper connection number of graphs (English)
0 references
23 June 2017
0 references
proper connection number
0 references
proper-path coloring
0 references
2-connected graph
0 references
3-edge-connected graph
0 references
diameter
0 references
0.9370725750923156
0 references
0.8942620158195496
0 references
0.8908546566963196
0 references
0.8903321623802185
0 references
0.8889485001564026
0 references
