Subgraphs with orthogonal factorizations and algorithms
DOI10.1016/J.EJC.2010.03.008zbMATH Open1208.05119OpenAlexW2049419313WikidataQ114184866 ScholiaQ114184866MaRDI QIDQ709242FDOQ709242
Authors: Changping Wang 
Publication date: 18 October 2010
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2010.03.008
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- An algorithmic proof of Tutte's f-factor theorem
- \((g,f)\)-factorizations orthogonal to a subgraph of a graph
- Existence of subgraphs with orthogonal \((g,f)\)-factorization
- Orthogonal \((g,f)\)-factorizations in graphs
- Orthogonal (g, f)-factorizations in networks
- Orthogonal factorizations of graphs
- Orthogonal factorizations of graphs
- Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
- A simple existence criterion for \((g<f)\)-factors
Cited In (10)
- 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
- Title not available (Why is that?)
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)
