The competition number of a graph with exactly \(h\) holes, all of which are independent
type: Item
instance of: scholarly article
title: The competition number of a graph with exactly \(h\) holes, all of which are independent
zbMATH Open document ID: 1204.05050
author: Bo-Jr Li
author: Gerard Jennhwa Chang
published in: Discrete Applied Mathematics
publication date: 2009-06-30T00:00:00Z
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 5571977
zbMATH Keywords: competition graph
zbMATH Keywords: competition number
zbMATH Keywords: chordal graph
zbMATH Keywords: chordless cycle
zbMATH Keywords: hole
zbMATH Keywords: independent hole
MaRDI profile type: Publication
full work available at URL: j.dam.2008.11.004
OpenAlex ID: W2010037440
cites work: Niche graphs
cites work: Niche numbers
cites work: Q3139771
cites work: Competition numbers of graphs with a small number of triangles
cites work: Q3479858
cites work: The competition-common enemy graph of a digraph
cites work: Q4171826
cites work: Q3322121
cites work: On the Computation of the Competition Number of a Graph
cites work: Q5752597
cites work: The competition number of a graph having exactly one hole
cites work: GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE
cites work: On rigid circuit graphs
DOI: 10.1016/J.DAM.2008.11.004
description: scientific article; zbMATH DE number 5571977