Finding any given 2-factor in sparse pseudorandom graphs efficiently (Q6314156)
From MaRDI portal
scientific article; zbMATH DE number 900558153
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding any given 2-factor in sparse pseudorandom graphs efficiently |
scientific article; zbMATH DE number 900558153 |
Statements
16 February 2019
0 references
math.CO
0 references
cs.DM
0 references
