Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph (Q1014835): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00373-008-0807-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083270457 / rank | |||
Normal rank | |||
Revision as of 19:30, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph |
scientific article |
Statements
Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph (English)
0 references
29 April 2009
0 references
path matching
0 references
three-vertex path
0 references
cubic graph
0 references
