Long cycles in graphs containing a 2-factor with many odd components (Q1343811): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3971997 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Long cycles in graphs with large degree sums / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4192100 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Degree sums, \(k\)-factors and Hamilton cycles in graphs / rank | |||
Normal rank |
Revision as of 11:43, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Long cycles in graphs containing a 2-factor with many odd components |
scientific article |
Statements
Long cycles in graphs containing a 2-factor with many odd components (English)
0 references
5 October 1995
0 references
Let \(\sigma_ k(G)\) denote the minimum sum of the degrees of any \(k\) independent vertices of \(G\). It is shown that if \(G\) is a 2-connected graph of order \(n\) that contains a 2-factor with at least \(k\) odd components, and if \(\sigma_ 3(G)\geq n+ 2\), then \(G\) contains a cycle of length at least \(\min\{n, \sigma(G)/3+ n/2+ k/2\}\). There are several consequences of this theorem, one of which is a positive solution to a conjecture of Häggkvist that if \(G\) is a 2-connected graph of order \(n\) that has a 2-factor with at least \(k- 1\) odd components (actually \(2k\) components in the conjecture) and \(\sigma_ 2(G)\geq n- k\), then \(G\) is hamiltonian.
0 references
long cycles
0 references
independent vertices
0 references
2-connected graph
0 references
2-factor
0 references
odd components
0 references
conjecture of Häggkvist
0 references
hamiltonian
0 references