Publication:4506268
From MaRDI portal
DOI<274::AID-NET6>3.0.CO;2-6 10.1002/1097-0037(200007)35:4<274::AID-NET6>3.0.CO;2-6zbMath0974.05065MaRDI QIDQ4506268
Peter Che Bor Lam, Wai Chee Shiu, Guo Jun Li, Gui Zhen Liu
Publication date: 12 December 2001
90B18: Communication networks in operations research
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Orthogonal factorizations in networks, Subdigraphs with orthogonal factorizations of digraphs, Subgraphs with orthogonal factorizations and algorithms, Toughness and \([a, b\)-factors with inclusion\(/\)exclusion properties], Orthogonal factorizations of digraphs, Some problems on factorizations with constraints in bipartite graphs, A result on \(r\)-orthogonal factorizations in digraphs, Subdigraphs with orthogonal factorizations of digraphs. II, Remarks on orthogonal factorizations of digraphs, Subgraphs with Orthogonal $$[0,k_{i}_{1}^{n}$$ [ 0 , k i ] 1 n -Factorizations in Graphs]
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
