Subdigraphs with orthogonal factorizations of digraphs

DOI10.1016/j.ejc.2012.01.010zbMath1242.05113OpenAlexW1996469228WikidataQ114184826 ScholiaQ114184826MaRDI QIDQ427789

Changping Wang

Publication date: 18 June 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2012.01.010

zbMATH Keywords

digraphfactorizationarc-disjoint subdigraphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items

Discussions on orthogonal factorizations in digraphs ⋮ The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ A result on \(r\)-orthogonal factorizations in digraphs ⋮ Remarks on orthogonal factorizations of digraphs ⋮ A generalization of orthogonal factorizations in digraphs ⋮ Subgraphs with Orthogonal $$[0,k_{i}_{1}^{n}$$ [ 0 , k i ] 1 n -Factorizations in Graphs] ⋮ Subdigraphs with orthogonal factorizations of digraphs. II

Cites Work

• Unnamed Item
• Subgraphs with orthogonal factorizations and algorithms
• Graph factors and factorization: 1985--2003: a survey
• Orthogonal factorizations of digraphs
• \((g,f)\)-factorizations orthogonal to a subgraph of a graph
• Existence of subgraphs with orthogonal \((g,f)\)-factorization
• 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
• Orthogonal factorizations of graphs

This page was built for publication: Subdigraphs with orthogonal factorizations of digraphs