Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
From MaRDI portal
Publication:2025161
DOI10.1007/s10255-021-1005-0zbMath1464.05223OpenAlexW3158304198MaRDI QIDQ2025161
Publication date: 11 May 2021
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-021-1005-0
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Minimum degree, independence number and pseudo \([2, b\)-factors in graphs]
- A neighborhood union condition for fractional ID-\([a, b\)-factor-critical graphs]
- Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs
- Edge-connectivity and edges of even factors of graphs
- Degree conditions for Hamiltonian graphs to have \([a,b\)-factors containing a given Hamiltonian cycle]
- The extension degree conditions for fractional factor
- Degree sum condition for the existence of spanning \(k\)-trees in star-free graphs
- Some results on path-factor critical avoidable graphs
- A degree condition for fractional \((g, f, n)\)-critical covered graphs
- Some existence theorems on path factors with given properties in graphs
- Subgraphs with orthogonal factorizations in graphs
- Research on fractional critical covered graphs
- A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
- Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- A degree condition implying ore-type condition for even \([2,b\)-factors in graphs]
- Note on Hamilton Circuits
- Remarks on path factors in graphs
- Subgraphs with prescribed valencies
- A \([k,k+1\)-factor containing a given Hamiltonian cycle]
This page was built for publication: Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
