A degree condition implying ore-type condition for even [2,b]-factors in graphs
From MaRDI portal
Publication:2364097
Recommendations
- Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
- scientific article; zbMATH DE number 1933054
- Sharp conditions for the existence of an even \([a,b]\)-factor in a graph
- Sharp Ore-type conditions for the existence of an even \([4,b]\)-factor in a graph
- Even [a,b]-factors in graphs
Cites work
Cited in
(12)- More on even [a,b]-factors in graphs
- Sharp conditions for the existence of an even \([a,b]\)-factor in a graph
- scientific article; zbMATH DE number 1933054 (Why is no real title available?)
- Sharp Ore-type conditions for the existence of an even \([4,b]\)-factor in a graph
- Large even factors of graphs
- Even [a,b]-factors in graphs
- Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
- Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
- On 2-edge-connected \([\mathbf{a,b}]\)-factors of graphs with Ore-type condition
- A characterization of a graph which has a 2-factor
- AN ORE-TYPE CONDITION FOR THE EXISTENCE OF EVEN [a,b]-FACTORS IN GRAPHS
- Stability number and even \([2,b]\)-factors in graphs
This page was built for publication: A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364097)
