A generalization of orthogonal factorizations in digraphs

DOI10.1016/j.ipl.2017.12.003zbMath1429.05171OpenAlexW2779427255WikidataQ114167111 ScholiaQ114167111MaRDI QIDQ1705655

Si-zhong Zhou, Zhi-ren Sun

Publication date: 16 March 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2017.12.003

zbMATH Keywords

digraphcombinatorial problems\((g,f)\)-factor\(k\)-orthogonal factorizationsubdigraph

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

Discussions on orthogonal factorizations in digraphs ⋮ A Note of Generalization of Fractional ID-factor-critical Graphs ⋮ Path factors in subgraphs ⋮ Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ Subgraphs with orthogonal factorizations in graphs ⋮ A degree condition for fractional \([a,b\)-covered graphs] ⋮ A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs ⋮ A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Subdigraphs with orthogonal factorizations of digraphs
• Orthogonal factorizations of digraphs
• Room designs and one-factorizations
• Randomly orthogonal \((g,f)\)-factorizations in graphs
• Subdigraphs with orthogonal factorizations of digraphs. II
• Remarks on orthogonal factorizations of digraphs
• 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

This page was built for publication: A generalization of orthogonal factorizations in digraphs