Erdős-Gallai-type results for total monochromatic connection of graphs (Q2312052)
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 7077017
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Erdős-Gallai-type results for total monochromatic connection of graphs |
scientific article; zbMATH DE number 7077017 |
Statements
Erdős-Gallai-type results for total monochromatic connection of graphs (English)
0 references
4 July 2019
0 references
total colored graph
0 references
total monochromatic connection
0 references
Erdős-Gallai-type problem
0 references
0.9098896384239196
0 references
0.9033387899398804
0 references
0.8871039748191833
0 references
0.8622742891311646
0 references
0.8582982420921326
0 references
