\((g,f)\)-factorizations orthogonal to a subgraph of a graph

DOI10.1007/BF02879045zbMath0909.05039OpenAlexW2040521550WikidataQ114233731 ScholiaQ114233731MaRDI QIDQ1128115

Guo Jun Li, Gui Zhen Liu

Publication date: 22 March 1999

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02879045

zbMATH Keywords

decompositionfactorizationfactor

Mathematics Subject Classification ID

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

Related Items (9)

Randomly orthogonal factorizations with constraints in bipartite networks ⋮ A result on \(r\)-orthogonal factorizations in digraphs ⋮ Randomly orthogonal factorizations in networks ⋮ Subdigraphs with orthogonal factorizations of digraphs ⋮ Randomly \(r\)-orthogonal factorizations in bipartite graphs ⋮ Subgraphs with orthogonal factorizations and algorithms ⋮ Some problems on factorizations with constraints in bipartite graphs ⋮ \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs ⋮ Randomly orthogonal \((g,f)\)-factorizations in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the existence of a matching orthogonal to a 2-factorization
• Orthogonal \((g,f)\)-factorizations in graphs
• \((g,f)\)-factorization orthogonal to a star in graphs
• Subgraphs with prescribed valencies

This page was built for publication: \((g,f)\)-factorizations orthogonal to a subgraph of a graph