Long cycles in graphs without Hamiltonian paths (Q998320): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Relative lengths of paths and cycles in 3-connected graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Relative length of long paths and cycles in graphs with large degree sums / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Relative length of longest paths and cycles in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Relative length of longest paths and cycles in 3-connected graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On relative length of longest paths and cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Longest paths and longest cycles in graphs with large degree sums / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4869540 / rank | |||
Normal rank |
Latest revision as of 01:05, 29 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Long cycles in graphs without Hamiltonian paths |
scientific article |
Statements
Long cycles in graphs without Hamiltonian paths (English)
0 references
28 January 2009
0 references
relative length
0 references
longest path
0 references
longest cycle
0 references