Discussions on orthogonal factorizations in digraphs
From MaRDI portal
Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Network design and communication in computer systems (68M10)
Recommendations
Cites work
- scientific article; zbMATH DE number 53885 (Why is no real title available?)
- A generalization of orthogonal factorizations in digraphs
- A generalization of orthogonal factorizations in graphs
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
- A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
- A polynomial algorithm for finding \((g,f)\)-colorings orthogonal to stars in bipartite graphs
- A result on fractional \((a,b,k)\)-critical covered graphs
- A toughness condition for fractional \((k, m)\)-deleted graphs revisited
- Binding numbers and restricted fractional ( g , f )-factors in graphs
- Component factors and binding number conditions in graphs
- Decomposition of graphs into \((g,f)\)-factors
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- On \(P_{\geq 3}\)-factor deleted graphs
- On k-orthogonal factorizations in networks
- On path-factor critical deleted (or covered) graphs
- Orthogonal (g, f)-factorizations in networks
- Orthogonal factorizations in networks
- Orthogonal factorizations of digraphs
- Orthogonal factorizations of graphs
- Orthogonal factorizations of graphs
- Path factors in subgraphs
- Randomly orthogonal (g,f)-factorizations in graphs
- Remarks on orthogonal factorizations of digraphs
- Remarks on path factors in graphs
- Research on fractional critical covered graphs
- Room designs and one-factorizations
- Some problems on factorizations with constraints in bipartite graphs
- Subdigraphs with orthogonal factorizations of digraphs
- Subgraphs with orthogonal factorizations in graphs
- Sufficient conditions for graphs to have (g,f)-factors
- The 1-Factors of Oriented Graphs
- Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
- Toughness, isolated toughness and path factors in graphs
- [a,b]-factorization of a graph
Cited in
(13)- Remarks on restricted fractional (g, f)-factors in graphs
- Path-factor critical covered graphs and path-factor uniform graphs
- Some sufficient conditions for path-factor uniform graphs
- The existence of subdigraphs with orthogonal factorizations in digraphs
- Discussion on fractional (a, b, k)-critical covered graphs
- Orthogonal decompositions of complete digraphs
- A Note of Generalization of Fractional ID-factor-critical Graphs
- Path factors and neighborhoods of independent sets in graphs
- Two sufficient conditions for odd \([1,b]\)-factors in graphs
- Some results about star-factors in graphs
- Isolated toughness and path-factor uniform graphs. II.
- Remarks on orthogonal factorizations of digraphs
- Randomly r-orthogonal factorizations in bipartite graphs
This page was built for publication: Discussions on orthogonal factorizations in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2125658)
