Orthogonal \((g,f)\)-factorizations in graphs
From MaRDI portal
Publication:1897433
DOI10.1016/0012-365X(94)00033-FzbMath0843.05083OpenAlexW2018936224WikidataQ114215616 ScholiaQ114215616MaRDI QIDQ1897433
Publication date: 13 August 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)00033-f
Related Items (17)
The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ A result on \(r\)-orthogonal factorizations in digraphs ⋮ \((g,f)\)-factorizations of graphs orthogonal to \([1,2\)-subgraphs] ⋮ \((g,f)\)-factorizations orthogonal to a subgraph of a graph ⋮ Existence of subgraphs with orthogonal \((g,f)\)-factorization ⋮ Subdigraphs with orthogonal factorizations of digraphs ⋮ Subgraphs with orthogonal factorizations in graphs ⋮ Subgraphs with Orthogonal $$[0,k_{i}_{1}^{n}$$ [ 0 , k i ] 1 n -Factorizations in Graphs] ⋮ Randomly \(r\)-orthogonal factorizations in bipartite graphs ⋮ Subdigraphs with orthogonal factorizations of digraphs. II ⋮ Orthogonal factorizations in networks ⋮ Orthogonal (g, f)-factorizations in networks ⋮ Subgraphs with orthogonal factorizations and algorithms ⋮ A generalization of orthogonal factorizations in graphs ⋮ Orthogonal factorizations of digraphs ⋮ \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs ⋮ Randomly orthogonal \((g,f)\)-factorizations in graphs
Cites Work
This page was built for publication: Orthogonal \((g,f)\)-factorizations in graphs
