Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph (Q1014835): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:40, 30 January 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
