On 2-edge-connected \([\mathbf{a,b}]\)-factors of graphs with Ore-type condition (Q2487985): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Factors and factorizations of graphs—a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A \([k,k+1]\)-factor containing a given Hamiltonian cycle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A \([k,k+1]\)-factor containing a given Hamiltonian cycle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2708242 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subgraphs with prescribed valencies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Note on Hamilton Circuits / rank | |||
Normal rank |
Latest revision as of 15:15, 10 June 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