Trinque problem: covering complete graphs by plane degree-bounded hypergraphs
Crossref DOI link: https://doi.org/10.1007/s10878-015-9978-3
Published Online: 2015-12-12
Published Print: 2017-02
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Charpentier, Clément
Gravier, Sylvain
Lecorre, Thomas
Text and Data Mining valid from 2015-12-12