Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs (Q1025460): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:11, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs |
scientific article |
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
