A result on \(r\)-orthogonal factorizations in digraphs
From MaRDI portal
Publication:2400968
DOI10.1016/j.ejc.2017.05.001zbMath1369.05096OpenAlexW2621103372WikidataQ114184783 ScholiaQ114184783MaRDI QIDQ2400968
Zhi-ren Sun, Zurun Xu, Si-zhong Zhou
Publication date: 31 August 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2017.05.001
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (13)
The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ A degree condition for fractional \((g, f, n)\)-critical covered graphs ⋮ Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs ⋮ A degree condition for fractional \([a,b\)-covered graphs] ⋮ Research on fractional critical covered graphs ⋮ Binding numbers and restricted fractional \(( g , f )\)-factors in graphs ⋮ The extension degree conditions for fractional factor ⋮ Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs ⋮ Neighborhood union conditions for fractional \([a, b\)-covered graphs] ⋮ Parameters and fractional factors in different settings ⋮ Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs ⋮ Degree conditions for fractional \((a,b,k)\)-critical covered graphs ⋮ Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subdigraphs with orthogonal factorizations of digraphs
- Subgraphs with orthogonal factorizations and algorithms
- Orthogonal factorizations of digraphs
- \((g,f)\)-factorizations orthogonal to a subgraph of a graph
- Room designs and one-factorizations
- A new result on Alspach's problem
- Some problems on factorizations with constraints in bipartite graphs
- Orthogonal \((g,f)\)-factorizations in graphs
- Randomly orthogonal factorizations in networks
- Subdigraphs with orthogonal factorizations of digraphs. II
- Remarks on orthogonal factorizations of digraphs
- Orthogonal (g, f)-factorizations in networks
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- The 1-Factors of Oriented Graphs
- Orthogonal factorizations of graphs
- A generalization of orthogonal factorizations in graphs
This page was built for publication: A result on \(r\)-orthogonal factorizations in digraphs
