Remarks on orthogonal factorizations of digraphs
From MaRDI portal
Recommendations
- Orthogonal factorizations of digraphs
- A generalization of orthogonal factorizations in digraphs
- Discussions on orthogonal factorizations in digraphs
- A result on r-orthogonal factorizations in digraphs
- scientific article; zbMATH DE number 2115826
- A generalization of orthogonal factorizations in graphs
- Orthogonal factorizations of graphs
- Orthogonal factorizations of graphs
- scientific article; zbMATH DE number 124514
- Orthogonal factorizations of graphs
Cites work
- Existence of subgraphs with orthogonal \((g,f)\)-factorization
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- Orthogonal (g, f)-factorizations in networks
- Orthogonal factorizations of digraphs
- Orthogonal factorizations of graphs
- Subdigraphs with orthogonal factorizations of digraphs
- Subgraphs with orthogonal factorizations and algorithms
Cited in
(30)- Orthogonal factorizations of digraphs
- Randomly orthogonal factorizations with constraints in bipartite networks
- A generalization of orthogonal factorizations in digraphs
- A degree condition for fractional \([a,b]\)-covered graphs
- Some existence theorems on all fractional (g,f)-factors with prescribed properties
- Neighborhood conditions for fractional ID-k-factor-critical graphs
- The extension degree conditions for fractional factor
- Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors
- Parameters and fractional factors in different settings
- Some results on path-factor critical avoidable graphs
- Discussions on orthogonal factorizations in digraphs
- The existence of subdigraphs with orthogonal factorizations in digraphs
- Some existence theorems on path factors with given properties in graphs
- Subgraphs with orthogonal factorizations in graphs
- Research on fractional critical covered graphs
- A sufficient condition for the existence of restricted fractional (g, f)-factors in graphs
- Binding numbers and restricted fractional ( g , f )-factors in graphs
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
- Neighborhood union conditions for fractional \([a, b]\)-covered graphs
- Remarks on fractional ID-\(k\)-factor-critical graphs
- Toughness condition for the existence of all fractional (a, b, k)-critical graphs
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- A result on r-orthogonal factorizations in digraphs
- Randomly orthogonal factorizations in networks
- A sufficient condition for the existence of a k-factor excluding a given r-factor
- A Divergence-like Characterization of Admissible Functions on Digraphs: A Combinatorial Proof
- An existence theorem on Hamiltonian (g,f)-factors in networks
- Some results about component factors in graphs
- Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
- On fractional (g, f, n^, m)-critical covered graphs
This page was built for publication: Remarks on orthogonal factorizations of digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931951)
