Orthogonal factorizations in networks

DOI10.1080/00207161003678498zbMath1226.05205OpenAlexW1988928504WikidataQ114101696 ScholiaQ114101696MaRDI QIDQ5391501

Changping Wang

Publication date: 6 April 2011

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207161003678498

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Discussions on orthogonal factorizations in digraphs ⋮ The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ Subgraphs with orthogonal factorizations in graphs ⋮ Subgraphs with Orthogonal $$[0,k_{i}_{1}^{n}$$ [ 0 , k i ] 1 n -Factorizations in Graphs]

Cites Work

• Existence of subgraphs with orthogonal \((g,f)\)-factorization
• Orthogonal \((g,f)\)-factorizations in graphs
• Orthogonal (g, f)-factorizations in networks
• Orthogonal factorizations of graphs
• Orthogonal factorizations of graphs

This page was built for publication: Orthogonal factorizations in networks