On 2-edge-connected [a,b]-factors of graphs with Ore-type condition
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.
- Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
- Two-edge-connected \([2,k]\)-factors in graphs
- Ore‐type condition for the existence of connected factors
- A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs
- Connected \([a,b]\)-factors in graphs
- A \([k,k+1]\)-factor containing a given Hamiltonian cycle
- A \([k,k+1]\)-factor containing a given Hamiltonian cycle
- Factors and factorizations of graphs—a survey
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Note on Hamilton Circuits
- Subgraphs with prescribed valencies
- Two-edge-connected \([2,k]\)-factors in graphs
This page was built for publication: On 2-edge-connected \([\mathbf{a,b}]\)-factors of graphs with Ore-type condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487985)
