Subgraphs with orthogonal factorizations and algorithms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 53885 (Why is no real title available?)
- A simple existence criterion for \((g<f)\)-factors
- Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
- An algorithmic proof of Tutte's f-factor theorem
- Existence of subgraphs with orthogonal \((g,f)\)-factorization
- Orthogonal (g, f)-factorizations in networks
- Orthogonal \((g,f)\)-factorizations in graphs
- Orthogonal factorizations of graphs
- Orthogonal factorizations of graphs
- \((g,f)\)-factorizations orthogonal to a subgraph of a graph
Cited in
(10)- scientific article; zbMATH DE number 1420459 (Why is no real title available?)
- Orthogonal (g, f)-factorizations in networks
- Subgraphs with orthogonal \([0,k_{i}]_{1}^{n}\)-factorizations in graphs
- Subdigraphs with orthogonal factorizations of digraphs
- Subgraphs with orthogonal factorizations in graphs
- A result on \(r\)-orthogonal factorizations in digraphs
- Randomly orthogonal factorizations with constraints in bipartite networks
- Subdigraphs with orthogonal factorizations of digraphs. II
- Remarks on orthogonal factorizations of digraphs
- Randomly \(r\)-orthogonal factorizations in bipartite graphs
This page was built for publication: Subgraphs with orthogonal factorizations and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709242)
