Revisit of Erdős-Gallai's theorem on the circumference of a graph (Q2444861): 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/j.ipl.2013.05.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1978850385 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Large cycles in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Variations on the Hamiltonian Theme / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On maximal paths and circuits of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some remarks on long monochromatic cycles in edge-colored complete graphs / rank | |||
Normal rank | |||
Latest revision as of 15:16, 7 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Revisit of Erdős-Gallai's theorem on the circumference of a graph |
scientific article |
Statements
Revisit of Erdős-Gallai's theorem on the circumference of a graph (English)
0 references
11 April 2014
0 references
graph algorithms
0 references
circumference
0 references
cycle
0 references
maximum number of edges
0 references
