Sharp Ore-type conditions for the existence of an even [4,b]-factor in a graph
From MaRDI portal
Publication:5089326
Recommendations
- A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs
- Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
- Sharp conditions for the existence of an even \([a,b]\)-factor in a graph
- Even [a,b]-factors in graphs
- scientific article; zbMATH DE number 1933054
Cites work
- scientific article; zbMATH DE number 1933054 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- A degree condition for a graph to have \((a,b)\)-parity factors
- An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues
- Eigenvalues and [a,b]‐factors in regular graphs
- Eigenvalues and \([1,n]\)-odd factors
- Even [a,b]-factors in graphs
- Matching and edge-connectivity in regular graphs
- Note on Hamilton Circuits
- On factorisation of graphs
- Ore-type conditions for the existence of even \([2,b]\)-factors in graphs
- Regular factors and eigenvalues of regular graphs
- Regular factors of regular graphs
- Regular graphs, eigenvalues and regular factors
- Sharp conditions for the existence of an even \([a,b]\)-factor in a graph
- Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
- The factorization of graphs. II
Cited in
(5)- 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
- AN ORE-TYPE CONDITION FOR THE EXISTENCE OF EVEN [a,b]-FACTORS IN GRAPHS
- A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs
- Sufficient condition for the existence of an even \([a,b]\)-factor in graph
This page was built for publication: Sharp Ore-type conditions for the existence of an even \([4,b]\)-factor in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089326)
