Orthogonal (g, f)-factorizations in networks

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0037(200007)35:4<274::AID-NET6>3.0.CO;2-6" /><274::AID-NET6>3.0.CO;2-6 10.1002/1097-0037(200007)35:4<274::AID-NET6>3.0.CO;2-6zbMath0974.05065OpenAlexW1997241393MaRDI QIDQ4506268

Guo Jun Li, Wai Chee Shiu, Peter Che Bor Lam, Gui Zhen Liu

Publication date: 12 December 2001

Full work available at URL: https://doi.org/10.1002/1097-0037(200007)35:4<274::aid-net6>3.0.co;2-6

zbMATH Keywords

networkgraph\((g,f)\)-factorizationorthogonal factorization

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (14)

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 ⋮ Subgraphs with orthogonal factorizations in graphs ⋮ A generalization of orthogonal factorizations in digraphs ⋮ Subgraphs with Orthogonal $$[0,k_{i}_{1}^{n}$$ [ 0 , k i ] 1 n -Factorizations in Graphs] ⋮ Subdigraphs with orthogonal factorizations of digraphs. II ⋮ Orthogonal factorizations in networks ⋮ Subgraphs with orthogonal factorizations and algorithms ⋮ Some problems on factorizations with constraints in bipartite graphs ⋮ Toughness and \([a, b\)-factors with inclusion\(/\)exclusion properties] ⋮ Orthogonal factorizations of digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• A simple existence criterion for \((g<f)\)-factors
• A characterization of graphs having all \((g,f)\)-factors
• Orthogonal \((g,f)\)-factorizations in graphs
• [a,b-factorization of a graph]
• Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
• An algorithmic proof of Tutte's f-factor theorem
• Subgraphs with prescribed valencies

This page was built for publication: Orthogonal (g, f)-factorizations in networks