Subdigraphs with orthogonal factorizations of digraphs. II
From MaRDI portal
Publication:2441627
DOI10.1016/j.ejc.2013.06.042zbMath1284.05117WikidataQ114184805 ScholiaQ114184805MaRDI QIDQ2441627
Publication date: 25 March 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2013.06.042
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C20: Directed graphs (digraphs), tournaments
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
An existence theorem on Hamiltonian (g,f)-factors in networks, Randomly orthogonal factorizations with constraints in bipartite networks, A generalization of orthogonal factorizations in digraphs, The existence of subdigraphs with orthogonal factorizations in digraphs, Subgraphs with orthogonal factorizations in graphs, A result on \(r\)-orthogonal factorizations in digraphs, Randomly orthogonal factorizations in networks, The existence of \(P_{\geq3}\)-factor covered graphs, Stability Number and k-Hamiltonian [a, b-factors], Subgraphs with Orthogonal $$[0,k_{i}_{1}^{n}$$ [ 0 , k i ] 1 n -Factorizations in Graphs]
Cites Work
- Unnamed Item
- Unnamed Item
- Subdigraphs with orthogonal factorizations of digraphs
- Subgraphs with orthogonal factorizations and algorithms
- Orthogonal factorizations of digraphs
- Some problems on factorizations with constraints in bipartite graphs
- Orthogonal \((g,f)\)-factorizations in graphs
- Factors and factorizations of graphs—a survey
- 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
