\((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs
From MaRDI portal
Publication:2581162
DOI10.1007/s10114-004-0482-4zbMath1081.05096OpenAlexW2136646597WikidataQ114228380 ScholiaQ114228380MaRDI QIDQ2581162
Xiaoxia Yan, Hao. Zhao, Gui Zhen Liu
Publication date: 9 January 2006
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-004-0482-4
Related Items (1)
Cites Work
- Unnamed Item
- 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
- Randomly orthogonal \((g,f)\)-factorizations in graphs
- 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: \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs
