A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two (Q1400955): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Partitioning vertices of 1-tough graphs into paths / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3818315 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4405192 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3880849 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matching theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Path factors of bipartite graphs / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0095-8956(03)00027-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037953913 / rank | |||
Normal rank | |||
Latest revision as of 08:49, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two |
scientific article |
Statements
A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two (English)
0 references
17 August 2003
0 references
sun
0 references
