A generalization of orthogonal factorizations in digraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 53885 (Why is no real title available?)
- scientific article; zbMATH DE number 2044929 (Why is no real title available?)
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- Orthogonal (g, f)-factorizations in networks
- Orthogonal factorizations of digraphs
- Orthogonal factorizations of graphs
- Randomly orthogonal (g,f)-factorizations in graphs
- Remarks on orthogonal factorizations of digraphs
- Room designs and one-factorizations
- Subdigraphs with orthogonal factorizations of digraphs
- Subdigraphs with orthogonal factorizations of digraphs. II
- The 1-Factors of Oriented Graphs
Cited in
(12)- Path factors in subgraphs
- Discussions on orthogonal factorizations in digraphs
- Subgraphs with orthogonal factorizations in graphs
- Orthogonal decompositions of complete digraphs
- Orthogonal factorizations of digraphs
- Toughness for fractional \((2, b, k)\)-critical covered graphs
- A sufficient condition for the existence of restricted fractional (g, f)-factors in graphs
- A Note of Generalization of Fractional ID-factor-critical Graphs
- A result on \(r\)-orthogonal factorizations in digraphs
- Remarks on orthogonal factorizations of digraphs
- A degree condition for fractional \([a,b]\)-covered graphs
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
This page was built for publication: A generalization of orthogonal factorizations in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1705655)