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

DOI10.1007/S10878-015-9978-3MaRDI QIDQ511700zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
• Covering and independence in triangle structures
• Multicovering hypergraphs
• On a generalized Erdős–Rademacher problem
• Covering the complete graph with plane cycles

Cites work

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

Cited in

(1)

• Minimum s-t hypercut in (s, t)-planar hypergraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511700)