Component factors and degree sum conditions in graphs
From MaRDI portal
Publication:6658862
Recommendations
Cites work
- scientific article; zbMATH DE number 3720956 (Why is no real title available?)
- A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
- Binding number for path-factor uniform graphs
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- Component factors with large components in graphs
- Factors and factorizations of graphs. Proof techniques in factor theory
- Fractional factors, component factors and isolated vertex conditions in graphs
- Fractional matchings, component-factors and edge-chromatic critical graphs
- Graph Factors and Matching Extensions
- Graph theory
- Note on Hamilton Circuits
- On factors with given components
- Packing paths of length at least two
- Path and cycle factors of cubic bipartite graphs
- Remarks on component factors
- Some degree conditions for \(\mathcal{P}_{\geq k}\)-factor covered graphs
- Some results about component factors in graphs
- Star-cycle factors of graphs
- Star-factors with large components
- Sufficient conditions for graphs with {P2, P5}-factors
- The 1-Factors of Oriented Graphs
- The Factors of Graphs
- The existence of \(P_{\geq3}\)-factor covered graphs
- The existence of path-factor covered graphs
- \(P_3\)-factors in the square of a tree
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)