Orthogonal factorizations of digraphs

DOI10.1007/s11464-009-0011-yzbMath1208.05114OpenAlexW2139177791WikidataQ114222320 ScholiaQ114222320MaRDI QIDQ1042545

Gui Zhen Liu

Publication date: 14 December 2009

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-009-0011-y

zbMATH Keywords

digraph\((g,f)\)-factororthogonal factorization

Mathematics Subject Classification ID

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

Related Items

Discussions on orthogonal factorizations in digraphs ⋮ The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ A result on \(r\)-orthogonal factorizations in digraphs ⋮ Remarks on orthogonal factorizations of digraphs ⋮ Subdigraphs with orthogonal factorizations of digraphs ⋮ A generalization of orthogonal factorizations in digraphs ⋮ Subdigraphs with orthogonal factorizations of digraphs. II

Cites Work

• Unnamed Item
• Some problems on factorizations with constraints in bipartite graphs
• Orthogonal \((g,f)\)-factorizations in graphs
• Factors and factorizations of graphs—a survey
• [a,b-factorization of a graph]
• 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
• Orthogonal matchings
• Orthogonal \((g,f)\)-factorizations of bipartite graphs