Some problems on factorizations with constraints in bipartite graphs
From MaRDI portal
Publication:1811123
DOI10.1016/S0166-218X(02)00503-6zbMath1018.05088WikidataQ114121919 ScholiaQ114121919MaRDI QIDQ1811123
Publication date: 10 June 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (12)
Discussions on orthogonal factorizations in digraphs ⋮ The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ Randomly orthogonal factorizations with constraints in bipartite networks ⋮ A result on \(r\)-orthogonal factorizations in digraphs ⋮ Randomly orthogonal factorizations in networks ⋮ Subgraphs with orthogonal factorizations in graphs ⋮ Subgraphs with Orthogonal $$[0,k_{i}_{1}^{n}$$ [ 0 , k i ] 1 n -Factorizations in Graphs] ⋮ Randomly \(r\)-orthogonal factorizations in bipartite graphs ⋮ Subdigraphs with orthogonal factorizations of digraphs. II ⋮ \((g,f)\)-factors with special properties in bipartite \((mg,mf)\)-graphs ⋮ An existence theorem on Hamiltonian (g,f)-factors in networks ⋮ Orthogonal factorizations of digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple existence criterion for \((g<f)\)-factors
- \((g,f)\)-factorizations orthogonal to a subgraph of a graph
- Connected \([a,b\)-factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor]
- Factors and factorizations of graphs—a survey
- [a,b-factorization of a graph]
- Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
- Orthogonal (g, f)-factorizations in networks
- An algorithmic proof of Tutte's f-factor theorem
- Orthogonal matchings
This page was built for publication: Some problems on factorizations with constraints in bipartite graphs
