An implicit degree condition for long cycles in 2-connected graphs (Q1031703): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4094891 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Large cycles in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New sufficient conditions for cycles in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A lower bound for the circumference of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5342985 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Implicit-degrees and circumferences / rank | |||
Normal rank |
Latest revision as of 02:11, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An implicit degree condition for long cycles in 2-connected graphs |
scientific article |
Statements
An implicit degree condition for long cycles in 2-connected graphs (English)
0 references
30 October 2009
0 references
long cycle
0 references
implicit degree
0 references
induced claw (modified claw)
0 references
0 references