Subgraphs with orthogonal factorizations and algorithms

DOI10.1016/J.EJC.2010.03.008zbMath1208.05119OpenAlexW2049419313WikidataQ114184866 ScholiaQ114184866MaRDI QIDQ709242

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

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Randomly orthogonal factorizations with constraints in bipartite networks ⋮ A result on \(r\)-orthogonal factorizations in digraphs ⋮ Remarks on orthogonal factorizations of digraphs ⋮ Subdigraphs with orthogonal factorizations of digraphs ⋮ 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

Cites Work

• Unnamed Item
• A simple existence criterion for \((g<f)\)-factors
• \((g,f)\)-factorizations orthogonal to a subgraph of a graph
• Existence of subgraphs with orthogonal \((g,f)\)-factorization
• Orthogonal \((g,f)\)-factorizations in graphs
• 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 factorizations of graphs
• Orthogonal factorizations of graphs

This page was built for publication: Subgraphs with orthogonal factorizations and algorithms