Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs (Q1025460): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3910557 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5184946 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Edmonds-Gallai decomposition for the \(k\)-piece packing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The <i>k</i>‐piece packing problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Packing paths of length at least two / rank | |||
Normal rank | |||
Latest revision as of 17:09, 1 July 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
