AN ORE-TYPE CONDITION FOR THE EXISTENCE OF EVEN [a,b]-FACTORS IN GRAPHS
From MaRDI portal
Publication:5076243
even \([a,b\)-factor]
Recommendations
- Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
- A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs
- An Ore-type condition for the existence of \(k\)-factors in graphs
- Some Ore-type conditions for the existence of connected \([2,k]\)-factors in graphs
- On 2-edge-connected \([\mathbf{a,b}]\)-factors of graphs with Ore-type condition
- Sharp Ore-type conditions for the existence of an even \([4,b]\)-factor in a graph
- Sufficient condition for the existence of an even \([a,b]\)-factor in graph
- Sharp conditions for the existence of an even \([a,b]\)-factor in a graph
- Two sufficient conditions for odd \([1,b]\)-factors in graphs
- Sufficient condition for the existence of \(\left[ {a,b} \right]\)-factors in graphs
Cites work
- scientific article; zbMATH DE number 1933054 (Why is no real title available?)
- A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs
- Even [a,b]-factors in graphs
- Graph theory
- Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
- Subgraphs with prescribed valencies
Cited in
(2)
This page was built for publication: AN ORE-TYPE CONDITION FOR THE EXISTENCE OF EVEN [a,b]-FACTORS IN GRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5076243)
