A degree sum condition with connectivity for relative length of longest paths and cycles (Q1045188): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2009.06.019 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2009.06.019 / rank | |||
Normal rank | |||
Latest revision as of 14:48, 10 December 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
