The existence of path-factor covered graphs

DOI10.7151/dmgt.2353OpenAlexW3084642006MaRDI QIDQ2107737

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

zbMATH Keywords

claw-free graphpath-factorisolated toughness\(P_{ \geq 2}\)-factor covered graph\(P_{ \geq 3}\)-factor covered graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Binding number and path-factor critical deleted graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On factors with given components
• Graph factors and factorization: 1985--2003: a survey
• Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered 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
• Packing paths of length at least two
• The existence of \(P_{\geq3}\)-factor covered graphs
• Tough graphs and Hamiltonian circuits.
• On packing 3-vertex paths in a graph
• Graph Factors and Matching Extensions
• Path and cycle factors of cubic bipartite graphs
• Path factors in cubic graphs
• Factors and factorizations of graphs—a survey
• Path factors of bipartite graphs
• Sufficient conditions for the existence of a path‐factor which are related to odd components
• The Factors of Graphs
• Partitioning vertices of 1-tough graphs into paths
• Path factors in claw-free graphs

This page was built for publication: The existence of path-factor covered graphs