An upper bound for the competition numbers of graphs
type: Item
instance of: scholarly article
title: An upper bound for the competition numbers of graphs
zbMATH Open document ID: 1226.05144
author: Akira Kamibeppu
published in: Discrete Applied Mathematics
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5703716
zbMATH Keywords: competition graph
zbMATH Keywords: competition number
zbMATH Keywords: chordal graph
zbMATH Keywords: hole
MaRDI profile type: Publication
full work available at URL: j.dam.2009.09.007
OpenAlex ID: W1986957580
cites work: The competition number of a graph having exactly one hole
cites work: GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE
cites work: Q3114944
cites work: The competition number of a graph with exactly \(h\) holes, all of which are independent
cites work: On the Computation of the Competition Number of a Graph
cites work: Q4171826
DOI: 10.1016/J.DAM.2009.09.007
description: scientific article; zbMATH DE number 5703716