Trinque problem: covering complete graphs by plane degree-bounded hypergraphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Combinatorial Optimization Année : 2017

Trinque problem: covering complete graphs by plane degree-bounded hypergraphs

Clément Charpentier
Sylvain Gravier
Thomas Lecorre
Fichier non déposé

Dates et versions

hal-01686552 , version 1 (17-01-2018)

Identifiants

Citer

Clément Charpentier, Sylvain Gravier, Thomas Lecorre. Trinque problem: covering complete graphs by plane degree-bounded hypergraphs. Journal of Combinatorial Optimization, 2017, 33 (2), pp.543 - 550. ⟨10.1007/s10878-015-9978-3⟩. ⟨hal-01686552⟩

Collections

UGA CNRS FOURIER
44 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More