On 2-edge-connected \([\mathbf{a,b}]\)-factors of graphs with Ore-type condition (Q2487985): 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.2005.01.004 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1982519742 / rank | |||
Normal rank |
Revision as of 01:23, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On 2-edge-connected \([\mathbf{a,b}]\)-factors of graphs with Ore-type condition |
scientific article |
Statements
On 2-edge-connected \([\mathbf{a,b}]\)-factors of graphs with Ore-type condition (English)
0 references
17 August 2005
0 references
The main result of the present paper is that for integers \(a,t\geq 2\) every \(2\)-edge-connected graph \(G\) of order \(| G| \geq 2(t+1)((a-2)t+a)+t-1\), minimum degree \(\delta(G)\geq a\) and with degree sum \(d_G(x)+d_G(y)\geq \frac{2| G| }{1+t}\) for every pair of non-adjacent vertices \(x\) and \(y\) has a \(2\)-edge-connected \([a,at]\)-factor. The degree condition in this result is best possible and it generalizes several known results starting with Ore's degree sum condition for the existence of a Hamiltonian cycle, i.e. a \(2\)-edge-connected \(2\)-factor.
0 references
connected factor
0 references