On Opsut's conjecture for hypercompetition numbers of hypergraphs
type: Item
instance of: scholarly article
title: On Opsut's conjecture for hypercompetition numbers of hypergraphs
zbMATH Open document ID: 1252.05156
author: Boram Park
author: Suh-Ryung Kim
published in: Discrete Applied Mathematics
publication date: 2012-10-26T00:00:00Z
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 6099355
zbMATH Keywords: competition graph
zbMATH Keywords: competition number
zbMATH Keywords: competition hypergraph
zbMATH Keywords: hypercompetition number
zbMATH Keywords: Opsut's conjecture
Wikidata QID: Q123262957
MaRDI profile type: Publication
full work available at URL: j.dam.2012.05.009
OpenAlex ID: W2083647872
cites work: Q3139771
cites work: Q3474667
cites work: Q3479858
cites work: On the Computation of the Competition Number of a Graph
cites work: On the hypercompetition numbers of hypergraphs
cites work: Q4171826
cites work: Competition hypergraphs
cites work: Competition hypergraphs of digraphs with certain properties I. Strong connectedness
cites work: Competition hypergraphs of digraphs with certain properties II. Hamiltonicity
cites work: Competition hypergraphs of products of digraphs
cites work: Q4032997
cites work: Q4856611
cites work: Competitive inheritance and limitedness of graphs
DOI: 10.1016/J.DAM.2012.05.009
Recommended article: Q3474667
Recommended article: On the hypercompetition numbers of hypergraphs
Recommended article: A generalization of Opsut's lower bounds for the competition number of a graph
Recommended article: Q4032997
Recommended article: A generalization of Opsut's result on the competition numbers of line graphs
Recommended article: On ${\mathcal N}$-hypergraphs
Recommended article: On some general operators of hypergraphs
Recommended article: Q2971226
Recommended article: On the spectrum of hypergraphs
Recommended article: On the hypercompetition numbers of hypergraphs with maximum degree at most two
description: scientific article; zbMATH DE number 6099355