Béla Csaba, Judit Nagy-György. Embedding Graphs Having Ore-Degree at Most Five. SIAM J. Discrete Math., 33(1):474-508, 2019. [doi]
@article{CsabaN19,
title = {Embedding Graphs Having Ore-Degree at Most Five},
author = {Béla Csaba and Judit Nagy-György},
year = {2019},
doi = {10.1137/17M1155442},
url = {https://doi.org/10.1137/17M1155442},
researchr = {https://researchr.org/publication/CsabaN19},
cites = {0},
citedby = {0},
journal = {SIAM J. Discrete Math.},
volume = {33},
number = {1},
pages = {474-508},
}