Pages that link to "Item:Q4506268"
From MaRDI portal
The following pages link to Orthogonal (g, f)-factorizations in networks (Q4506268):
Displaying 14 items.
- Subdigraphs with orthogonal factorizations of digraphs (Q427789) (← links)
- Subgraphs with orthogonal factorizations and algorithms (Q709242) (← links)
- Toughness and \([a, b]\)-factors with inclusion\(/\)exclusion properties (Q763635) (← links)
- Orthogonal factorizations of digraphs (Q1042545) (← links)
- A generalization of orthogonal factorizations in digraphs (Q1705655) (← links)
- Some problems on factorizations with constraints in bipartite graphs (Q1811123) (← links)
- Discussions on orthogonal factorizations in digraphs (Q2125658) (← links)
- The existence of subdigraphs with orthogonal factorizations in digraphs (Q2131531) (← links)
- Subgraphs with orthogonal factorizations in graphs (Q2201767) (← links)
- A result on \(r\)-orthogonal factorizations in digraphs (Q2400968) (← links)
- Subdigraphs with orthogonal factorizations of digraphs. II (Q2441627) (← links)
- Remarks on orthogonal factorizations of digraphs (Q2931951) (← links)
- Subgraphs with Orthogonal $$[0,k_{i}]_{1}^{n}$$ [ 0 , k i ] 1 n -Factorizations in Graphs (Q2971666) (← links)
- Orthogonal factorizations in networks (Q5391501) (← links)
