The existence of path-factor covered graphs
DOI10.7151/DMGT.2353OpenAlexW3084642006MaRDI QIDQ2107737FDOQ2107737
Authors: Guowei Dai 
Publication date: 2 December 2022
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2353
Recommendations
- The existence of \(P_{\geq3}\)-factor covered graphs
- Some existence theorems on path factors with given properties in graphs
- On path-factor critical deleted (or covered) graphs
- scientific article; zbMATH DE number 4033791
- Nontrivial path covers of graphs: existence, minimization and maximization
- Complete-factors and \((g,f)\)-covered graphs
- Well-covered graphs and factors
- The existence of path-factor uniform graphs with large connectivity
- Covering a graph with nontrivial vertex-disjoint paths: existence and optimization
- Partial and perfect path covers of cographs
claw-free graphpath-factorisolated toughness\(P_{ \geq 2}\)-factor covered graph\(P_{ \geq 3}\)-factor covered graph
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph theory with applications
- Factors and factorizations of graphs—a survey
- Tough graphs and Hamiltonian circuits.
- The Factors of Graphs
- Graph Factors and Matching Extensions
- Graph factors and factorization: 1985--2003: a survey
- On factors with given components
- Path factors in claw-free 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?)
- Path factors in cubic graphs
- On packing 3-vertex paths in a graph
- Packing paths of length at least two
- Path and cycle factors of cubic bipartite graphs
- Fractional \((g,f)\)-factors in graphs
- Path factors of bipartite graphs
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- Sufficient conditions for the existence of a path‐factor which are related to odd components
- Partitioning vertices of 1-tough graphs into paths
- The existence of \(P_{\geq3}\)-factor covered graphs
Cited In (17)
- Path factors and line graphs
- A note on path factors in claw-free graphs.
- Binding number and path-factor critical deleted graphs
- Toughness and isolated toughness conditions for path-factor critical covered graphs
- Some existence theorems on path factors with given properties in graphs
- Closure, path-factors and path coverings in claw-free graphs
- Title not available (Why is that?)
- The existence of \(P_{\geq3}\)-factor covered graphs
- Path factors and neighborhoods of independent sets in graphs
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- Tight toughness bounds for path-factor critical avoidable graphs
- On graph-based network parameters and component factors in networks
- Component factors and degree sum conditions in graphs
- Degree conditions for path-factors in graphs
- Degree sum conditions for path-factor uniform graphs
- On path-factor critical deleted (or covered) graphs
- \(\{P_2,C_i\mid i\geq 3\}\)-covered graphs
This page was built for publication: The existence of path-factor covered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107737)
