Monochromatic paths and circuits in edge-colored graphs (Q2542059): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(71)90054-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037591235 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Simple Proof of a Theorem of Erdös and Szekeres<sup>*</sup> / rank | |||
Normal rank | |||
Latest revision as of 02:21, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Monochromatic paths and circuits in edge-colored graphs |
scientific article |
Statements
Monochromatic paths and circuits in edge-colored graphs (English)
0 references
1971
0 references
