Pages that link to "Item:Q1180675"

The following pages link to An Ore-type condition for the existence of \(k\)-factors in graphs (Q1180675):

Displaying 17 items.

• Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
• Degree condition for the existence of a \(k\)-factor containing a given Hamiltonian cycle (Q1025493) (← links)
• Minimum degree of a graph and the existence of k-factors (Q1071789) (← links)
• A degree condition for the existence of 1-factors in graphs or their complements (Q1301648) (← links)
• Connected \([k,k+1]\)-factors of graphs (Q1357718) (← links)
• \(k\)-factor and \(l\)-closure in graphs (Q1772195) (← links)
• Minimum degree, independence number and regular factors (Q1906860) (← links)
• Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphs (Q2461313) (← links)
• Ore-type conditions for the existence of even \([2,b]\)-factors in graphs (Q2576834) (← links)
• Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph (Q2689114) (← links)
• Approximation and Exact Algorithms for Special Cases of Connected f-Factors (Q3194728) (← links)
• (Q4472687) (← links)
• Sharp conditions for the existence of an even $[a,b]$-factor in a graph (Q4991404) (← links)
• AN ORE-TYPE CONDITION FOR THE EXISTENCE OF EVEN [a,b]-FACTORS IN GRAPHS (Q5076243) (← links)
• Ore‐type condition for the existence of connected factors (Q5434257) (← links)
• (Q5453046) (← links)
• A \([k,k+1]\)-factor containing a given Hamiltonian cycle (Q5967034) (← links)