Pages that link to "Item:Q4376498"

The following pages link to A degree condition for a graph to have \([a,b]\)-factors (Q4376498):

Displaying 20 items.

• Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
• More sufficient conditions for a graph to have factors (Q1584225) (← links)
• A new degree condition for graphs to have \([a,b]\)-factor (Q1764908) (← links)
• Degree conditions for Hamiltonian graphs to have \([a,b]\)-factors containing a given Hamiltonian cycle (Q1827685) (← links)
• Proof of a conjecture on the spectral radius condition for \([a,b]\)-factors (Q2111929) (← links)
• A degree condition for fractional \((g, f, n)\)-critical covered graphs (Q2132837) (← links)
• Spectral radius and \([a,b]\)-factors in graphs (Q2138986) (← links)
• Nontrivial path covers of graphs: existence, minimization and maximization (Q2292153) (← links)
• Neighborhood union conditions for fractional \([a, b]\)-covered graphs (Q2302016) (← links)
• Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle (Q2400580) (← links)
• A degree condition for a graph to have \((a,b)\)-parity factors (Q2411624) (← links)
• Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphs (Q2461313) (← links)
• Fan-type results for the existence of [\(a\),\(b\)]-factors (Q2488945) (← links)
• \(K_5^-\)-factor in a graph. (Q2823202) (← links)
• A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[<i>a</i>,<i>b</i>]-FACTOR-CRITICAL GRAPHS (Q3167456) (← links)
• (Q4802008) (← links)
• Neighbourhood conditions for fractional ID-[a, b]-factor-critical graphs (Q5031076) (← links)
• (Q5284643) (← links)
• A degree condition for graphs having all \((a, b)\)-parity factors (Q6565526) (← links)
• The \(A_{\alpha}\)-spectral radius and \([a,b]\)-factors in graphs (Q6614496) (← links)