Pages that link to "Item:Q2931951"
From MaRDI portal
The following pages link to Remarks on orthogonal factorizations of digraphs (Q2931951):
Displayed 27 items.
- Randomly orthogonal factorizations with constraints in bipartite networks (Q1663915) (← links)
- A generalization of orthogonal factorizations in digraphs (Q1705655) (← links)
- A degree condition for fractional \([a,b]\)-covered graphs (Q1711417) (← links)
- Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties (Q1753364) (← links)
- Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs (Q1782047) (← links)
- The extension degree conditions for fractional factor (Q1987571) (← links)
- Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors (Q2023721) (← links)
- Parameters and fractional factors in different settings (Q2067894) (← links)
- Some results on path-factor critical avoidable graphs (Q2107757) (← links)
- Discussions on orthogonal factorizations in digraphs (Q2125658) (← links)
- The existence of subdigraphs with orthogonal factorizations in digraphs (Q2131531) (← links)
- Some existence theorems on path factors with given properties in graphs (Q2199110) (← links)
- Subgraphs with orthogonal factorizations in graphs (Q2201767) (← links)
- Research on fractional critical covered graphs (Q2211178) (← links)
- A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs (Q2229576) (← links)
- Binding numbers and restricted fractional \(( g , f )\)-factors in graphs (Q2235291) (← links)
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs (Q2286579) (← links)
- Neighborhood union conditions for fractional \([a, b]\)-covered graphs (Q2302016) (← links)
- Remarks on fractional ID-\(k\)-factor-critical graphs (Q2316312) (← links)
- Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs (Q2319715) (← links)
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs (Q2328309) (← links)
- A result on \(r\)-orthogonal factorizations in digraphs (Q2400968) (← links)
- Randomly orthogonal factorizations in networks (Q2408369) (← links)
- A sufficient condition for the existence of a <i>k</i>-factor excluding a given <i>r</i>-factor (Q4597678) (← links)
- An existence theorem on Hamiltonian (g,f)-factors in networks (Q5225333) (← links)
- Some results about component factors in graphs (Q5242258) (← links)
- Toughness condition for a graph to be all fractional (g,f,n)-critical deleted (Q5863628) (← links)