Discussions on orthogonal factorizations in digraphs

DOI10.1007/s10255-022-1086-4zbMath1486.05122OpenAlexW4226402624WikidataQ114228094 ScholiaQ114228094MaRDI QIDQ2125658

Hongxia Liu, Si-zhong Zhou

Publication date: 14 April 2022

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-022-1086-4

zbMATH Keywords

networkdigraphfactorizationfactororthogonal factorization

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ A Note of Generalization of Fractional ID-factor-critical Graphs ⋮ Path factors and neighborhoods of independent sets in graphs ⋮ Isolated toughness and path-factor uniform graphs. II. ⋮ Two sufficient conditions for odd \([1,b\)-factors in graphs] ⋮ Path-factor critical covered graphs and path-factor uniform graphs ⋮ Some sufficient conditions for path-factor uniform graphs ⋮ Randomly \(r\)-orthogonal factorizations in bipartite graphs

Cites Work

• Unnamed Item
• Subdigraphs with orthogonal factorizations of digraphs
• Orthogonal factorizations of digraphs
• Room designs and one-factorizations
• A generalization of orthogonal factorizations in digraphs
• Some problems on factorizations with constraints in bipartite graphs
• Randomly orthogonal \((g,f)\)-factorizations in graphs
• Sufficient conditions for graphs to have \((g,f)\)-factors
• Decomposition of graphs into \((g,f)\)-factors
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• On \(P_{\geq 3}\)-factor deleted graphs
• Component factors and binding number conditions in graphs
• On path-factor critical deleted (or covered) graphs
• Path factors in subgraphs
• A note on fractional ID-\( [ a , b \)-factor-critical covered graphs]
• Subgraphs with orthogonal factorizations in graphs
• Research on fractional critical covered graphs
• Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
• A result on fractional \((a,b,k)\)-critical covered graphs
• A toughness condition for fractional \((k, m)\)-deleted graphs revisited
• A polynomial algorithm for finding \((g,f)\)-colorings orthogonal to stars in bipartite graphs
• Remarks on orthogonal factorizations of digraphs
• Remarks on path factors in graphs
• [a,b-factorization of a graph]
• Orthogonal (g, f)-factorizations in networks
• On k-orthogonal factorizations in networks
• Orthogonal factorizations in networks
• Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
• The 1-Factors of Oriented Graphs
• Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
• TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
• Orthogonal factorizations of graphs
• Orthogonal factorizations of graphs
• A generalization of orthogonal factorizations in graphs

This page was built for publication: Discussions on orthogonal factorizations in digraphs