A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs (Q429657)
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: A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs |
scientific article; zbMATH DE number 6048238
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs |
scientific article; zbMATH DE number 6048238 |
Statements
A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs (English)
0 references
20 June 2012
0 references
triangle-free 2-matching
0 references
subcubic graph
0 references
degree sequence
0 references
jump system
0 references
\(M\)-concave function
0 references
0 references
0.8941650986671448
0 references
0.8845057487487793
0 references
0.8591247797012329
0 references
0.8555466532707214
0 references
