A degree sum condition with connectivity for relative length of longest paths and cycles (Q1045188): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2009.06.019 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2069241802 / rank | |||
Normal rank | |||
Revision as of 22:35, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A degree sum condition with connectivity for relative length of longest paths and cycles |
scientific article |
Statements
A degree sum condition with connectivity for relative length of longest paths and cycles (English)
0 references
15 December 2009
0 references
degree sum
0 references
longest cycle
0 references
longest path
0 references
dominating cycle
0 references
