An Erdős-Gallai type theorem for vertex colored graphs (Q2000563)
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: An Erdős-Gallai type theorem for vertex colored graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Erdős-Gallai type theorem for vertex colored graphs |
scientific article |
Statements
An Erdős-Gallai type theorem for vertex colored graphs (English)
0 references
28 June 2019
0 references
extremal
0 references
paths
0 references
cycles
0 references
trees
0 references
vertex coloring
0 references
0 references
0.92496204
0 references
0.91931605
0 references
0 references
0.9165739
0 references
0.9093745
0 references
0.9069673
0 references
0 references
