Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph (Q1014835)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tighter bounds on the size of a maximum P₃-matching in a cubic graph |
scientific article; zbMATH DE number 5549547
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph |
scientific article; zbMATH DE number 5549547 |
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
