A degree condition implying ore-type condition for even [2,b]-factors in graphs
From MaRDI portal
Publication:2364097
DOI10.7151/DMGT.1964zbMATH Open1366.05083OpenAlexW2588229365MaRDI QIDQ2364097FDOQ2364097
Authors: Shoichi Tsuchiya, Takamasa Yashima 
Publication date: 17 July 2017
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1964
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)
- Sharp conditions for the existence of an even \([a,b]\)-factor in a graph
- Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
- Large even factors of graphs
- Sharp Ore-type conditions for the existence of an even \([4,b]\)-factor in a graph
- Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
- AN ORE-TYPE CONDITION FOR THE EXISTENCE OF EVEN [a,b]-FACTORS IN GRAPHS
- More on even [a,b]-factors in graphs
- On 2-edge-connected \([\mathbf{a,b}]\)-factors of graphs with Ore-type condition
- Even [a,b]-factors in graphs
- A characterization of a graph which has a 2-factor
- Title not available (Why is that?)
- 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)
