Randomly \(r\)-orthogonal factorizations in bipartite graphs
From MaRDI portal
Publication:2699238
DOI10.1007/s00010-022-00927-wOpenAlexW4311527675MaRDI QIDQ2699238
Publication date: 26 April 2023
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00010-022-00927-w
Cites Work
- Unnamed Item
- Randomly orthogonal factorizations of bipartite graphs
- Subgraphs with orthogonal factorizations and algorithms
- \((g,f)\)-factorizations orthogonal to a subgraph of a graph
- Randomly orthogonal factorizations with constraints in bipartite networks
- Some problems on factorizations with constraints in bipartite graphs
- Orthogonal \((g,f)\)-factorizations in graphs
- Discussions on orthogonal factorizations in digraphs
- Subgraphs with orthogonal factorizations in graphs
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- Randomly orthogonal factorizations in networks
- Factors and factorizations of graphs—a survey
- Orthogonal factorizations of graphs
- Orthogonal factorizations of graphs
This page was built for publication: Randomly \(r\)-orthogonal factorizations in bipartite graphs