Embedding Graphs Having Ore-Degree at Most Five (Q3119788)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embedding Graphs Having Ore-Degree at Most Five |
scientific article |
Statements
Embedding Graphs Having Ore-Degree at Most Five (English)
0 references
13 March 2019
0 references
embedding problems
0 references
Ore-degree
0 references
Bollobás-Eldridge-Catlin conjecture
0 references
