Component factors and degree sum conditions in graphs
From MaRDI portal
Publication:6658862
DOI10.1051/RO/2024170MaRDI QIDQ6658862FDOQ6658862
Authors: Hui Qin, Guowei Dai, Yuan Chen, Ting Jin, Yuan Yuan 
Publication date: 8 January 2025
Published in: RAIRO. Operations Research (Search for Journal in Brave)
Recommendations
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory
- Note on Hamilton Circuits
- Factors and factorizations of graphs. Proof techniques in factor theory
- The 1-Factors of Oriented Graphs
- The Factors of Graphs
- Graph Factors and Matching Extensions
- Star-factors with large components
- On factors with given components
- Component factors with large components in graphs
- Star-cycle factors of graphs
- A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
- Title not available (Why is that?)
- Packing paths of length at least two
- Path and cycle factors of cubic bipartite graphs
- Some results about component factors in graphs
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- The existence of \(P_{\geq3}\)-factor covered graphs
- The existence of path-factor covered graphs
- Fractional factors, component factors and isolated vertex conditions in graphs
- Fractional matchings, component-factors and edge-chromatic critical graphs
- Remarks on component factors
- Some degree conditions for \(\mathcal{P}_{\geq k}\)-factor covered graphs
- \(P_3\)-factors in the square of a tree
- Sufficient conditions for graphs with {P2, P5}-factors
- Binding number for path-factor uniform graphs
Cited In (1)
This page was built for publication: Component factors and degree sum conditions in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6658862)
