Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
From MaRDI portal
Publication:1025460
DOI10.1016/j.disc.2008.04.022zbMath1205.05187MaRDI QIDQ1025460
Publication date: 19 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.022
\({\mathcal{P}}_{\geq 2}\)-factor; \({\mathcal{P}}_{\geq 2}\)-factor covered graph; \({\mathcal{P}}_{\geq 3}\)-factor; \({\mathcal{P}}_{\geq 3}\)-factor covered graph
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Some results about component factors in graphs, The existence of \(P_{\geq3}\)-factor covered graphs
Cites Work