Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs (Q1025460)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs |
scientific article; zbMATH DE number 5566672
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs |
scientific article; zbMATH DE number 5566672 |
Statements
Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs (English)
0 references
19 June 2009
0 references
\({\mathcal{P}}_{\geq 2}\)-factor
0 references
\({\mathcal{P}}_{\geq 3}\)-factor
0 references
\({\mathcal{P}}_{\geq 2}\)-factor covered graph
0 references
\({\mathcal{P}}_{\geq 3}\)-factor covered graph
0 references
