On interval clutters
type: Item
instance of: scholarly article
title: On interval clutters
zbMATH Open document ID: 0995.05105
DOI: 10.1016/S0012-365X(01)00354-5
author: Guoli Ding
published in: Discrete Mathematics
publication date: 2002-08-29T00:00:00Z
review text: A hypergraph is called interval hypergraph, if its vertices can be linearly order that every edge is a consecutive set of vertices. Some thirty years back Tucker gave a characterization of interval hypergraphs in terms of excluded subhypergraphs. This paper characterizes interval clutter hypergraphs in terms of excluded minors and excluded subclutters (a clutter has no two comparable edges).
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C83
zbMATH DE Number: 1792452
zbMATH Keywords: interval hypergraph
zbMATH Keywords: excluded minors
reviewed by: Péter L. Erdős
MaRDI profile type: Publication
full work available at URL: s0012-365x(01)00354-5
OpenAlex ID: W1999432964
description: scientific article; zbMATH DE number 1792452