Sufficient conditions for a graph kG admitting all [1, k]-factors
From MaRDI portal
Publication:6586578
DOI10.61091/jcmcc120-09zbMATH Open1545.05186MaRDI QIDQ6586578FDOQ6586578
Authors: Jie Wu 
Publication date: 13 August 2024
Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)
Recommendations
spanning subgraph\([1, k\)-factors]\(\varphi\)-factor
Cites Work
- The Factorization of Linear Graphs
- A neighbourhood condition for graphs to have \([a,b]\)-factors
- Fractional \(k\)-factors of graphs
- Sufficient conditions for matchings
- A sufficient condition for a graph to have \([a,b]\)-factors
- A characterization of graphs having all \((g,f)\)-factors
- Some results about component factors in graphs
- 4-factors in 2-connected star-free graphs
- A degree condition for the existence of regular factors inK1,n-free graphs
- Remarks on path factors in graphs
- Subgraphs with orthogonal factorizations in graphs
- Some existence theorems on path factors with given properties in graphs
- Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties
- A degree condition for fractional \((g, f, n)\)-critical covered graphs
- Neighborhood union conditions for fractional \([a, b]\)-covered graphs
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- Characterizations of graphs \(G\) having all \([1, k]\)-factors in \(k G\)
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
- A tight neighborhood union condition on fractional \((g,f,n',m)\)-critical deleted graphs
- Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs
- A note on \(m\)-near-factor-critical graphs
- Connected odd factors of graphs
- \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs
- The \(A_\alpha\)-spectral radius for path-factors in graphs
- Distance signless Laplacian spectral radius for the existence of path-factors in graphs
This page was built for publication: Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586578)
