Randomly orthogonal \((g,f)\)-factorizations in graphs

DOI10.1007/s102550200050zbMath1010.05053OpenAlexW2041234071WikidataQ114228096 ScholiaQ114228096MaRDI QIDQ1862827

Gui Zhen Liu, He Ping Long

Publication date: 5 May 2003

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

Full work available at URL: https://doi.org/10.1007/s102550200050

zbMATH Keywords

\((g,f)\)-factorizationrandomly \(k\)-orthogonal factorization

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (8)

Discussions on orthogonal factorizations in digraphs ⋮ The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ Randomly orthogonal factorizations with constraints in bipartite networks ⋮ Randomly orthogonal factorizations in networks ⋮ Subgraphs with orthogonal factorizations in graphs ⋮ A generalization of orthogonal factorizations in digraphs ⋮ Subgraphs with Orthogonal $$[0,k_{i}_{1}^{n}$$ [ 0 , k i ] 1 n -Factorizations in Graphs] ⋮ \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A simple existence criterion for \((g<f)\)-factors
• \((g,f)\)-factorizations orthogonal to a subgraph of a graph
• Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor
• A characterization of graphs having all \((g,f)\)-factors
• Orthogonal \((g,f)\)-factorizations in graphs
• \((g,f)\)-factorization orthogonal to a star in graphs
• [a,b-factorization of a graph]
• Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
• An algorithmic proof of Tutte's f-factor theorem
• Subgraphs with prescribed valencies

This page was built for publication: Randomly orthogonal \((g,f)\)-factorizations in graphs