Remarks on orthogonal factorizations of digraphs
From MaRDI portal
Publication:2931951
DOI10.1080/00207160.2014.881993zbMath1303.05159OpenAlexW1980838889WikidataQ114101725 ScholiaQ114101725MaRDI QIDQ2931951
Publication date: 28 November 2014
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2014.881993
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items
Discussions on orthogonal factorizations in digraphs ⋮ The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ Randomly orthogonal factorizations with constraints in bipartite networks ⋮ 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 ⋮ Some existence theorems on path factors with given properties in graphs ⋮ Subgraphs with orthogonal factorizations in graphs ⋮ A generalization of orthogonal factorizations in digraphs ⋮ A degree condition for fractional \([a,b\)-covered 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 ⋮ The extension degree conditions for fractional factor ⋮ Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties ⋮ Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Neighborhood conditions for fractional ID-\(k\)-factor-critical 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] ⋮ An existence theorem on Hamiltonian (g,f)-factors in networks ⋮ Parameters and fractional factors in different settings ⋮ Remarks on fractional ID-\(k\)-factor-critical graphs ⋮ Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs ⋮ Some results about component factors in 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 ⋮ Some results on path-factor critical avoidable graphs
Cites Work
- Subdigraphs with orthogonal factorizations of digraphs
- Subgraphs with orthogonal factorizations and algorithms
- Orthogonal factorizations of digraphs
- Existence of subgraphs with orthogonal \((g,f)\)-factorization
- Orthogonal (g, f)-factorizations in networks
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- Orthogonal factorizations of graphs
