More on total monochromatic connection of graphs. (Q4568204)
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 6890360
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | More on total monochromatic connection of graphs. |
scientific article; zbMATH DE number 6890360 |
Statements
15 June 2018
0 references
total-colored graph
0 references
total monochromatic connection
0 references
random graphs
0 references
NP-completeness
0 references
0.9098896384239196
0 references
0.9087318778038024
0 references
0.8755242228507996
0 references
0.8200185298919678
0 references
0.8127408623695374
0 references
