Smallest set-transversals of \(k\)-partitions
type: Item
instance of: scholarly article
title: Smallest set-transversals of \(k\)-partitions
zbMATH Open document ID: 1205.05114
author: Csilla Bujtás
author: Zsolt Tuza
published in: Graphs and Combinatorics
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 5703796
Wikidata QID: Q59072690
MaRDI profile type: Publication
full work available at URL: s00373-010-0890-4
OpenAlex ID: W2080264125
cites work: On the minimum size of tight hypergraphs
cites work: The size of minimum 3-trees
cites work: A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
cites work: About the upper chromatic number of a co-hypergraph
cites work: Forestation in hypergraphs: Linear \(k\)-trees
cites work: Un problème extremal pour les graphes et les hypergraphes
cites work: Un Probleme De Coloration Aux Aspects Varies
cites work: Q4842710
cites work: Coloring mixed hypergraphs: theory, algorithms and applications
DOI: 10.1007/S00373-010-0890-4
description: scientific article; zbMATH DE number 5703796