Covering complete hypergraphs with cuts of minimum total size
type: Item
instance of: scholarly article
title: Covering complete hypergraphs with cuts of minimum total size
zbMATH Open document ID: 1234.05171
author: Sebastian Cioaba
author: André Kündgen
published in: Graphs and Combinatorics
publication date: 2012-01-24T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5999879
zbMATH Keywords: hypergraph
zbMATH Keywords: cut
zbMATH Keywords: cover
zbMATH Keywords: 2-Colorable
MaRDI profile type: Publication
full work available at URL: s00373-011-1030-5
OpenAlex ID: W2095539279
cites work: Separating systems and oriented graphs of diameter two
cites work: On separating systems
cites work: On the Size of Separating Systems and Families of Perfect Hash Functions
cites work: Covering a graph with cuts of minimum total size
cites work: Q4198056
cites work: An application of graph coloring to printed circuit testing
cites work: The biparticity of a graph
cites work: On shortest cocycle covers of graphs
cites work: On separating systems of a finite set
cites work: On embedding complete graphs into hypercubes
cites work: A bound on the total size of a cut cover
cites work: Q4242950
cites work: k-Components, Clusters and Slicings in Graphs
cites work: Chromatic numbers of hypergraphs and coverings of graphs
cites work: Q3279628
DOI: 10.1007/S00373-011-1030-5
description: scientific article; zbMATH DE number 5999879