The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices (Q6144493)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7796522
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices |
scientific article; zbMATH DE number 7796522 |
Statements
The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices (English)
0 references
29 January 2024
0 references
4-vertex path
0 references
packing
0 references
cubic graph
0 references
quadratic-time algorithm
0 references
0 references
0.8698055148124695
0 references
0.8605470061302185
0 references
0.8420190215110779
0 references
0.8321563601493835
0 references
0.8251296281814575
0 references
