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

DOI10.1007/s10878-015-9978-3zbMath1361.90061OpenAlexW2219930753MaRDI QIDQ511700

Clément Charpentier, Sylvain Gravier, Thomas Lecorre

Publication date: 22 February 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9978-3

zbMATH Keywords

complete graphsedge coveringedge partitionplane hypergraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Hypermaps versus bipartite maps
• Subdivision Drawings of Hypergraphs
• Hypergraph planarity and the complexity of drawing venn diagrams

This page was built for publication: Trinque problem: covering complete graphs by plane degree-bounded hypergraphs