A sufficient condition for Kim's conjecture on the competition numbers of graphs
type: Item
instance of: scholarly article
title: A sufficient condition for Kim's conjecture on the competition numbers of graphs
zbMATH Open document ID: 1238.05106
author: Akira Kamibeppu
published in: Discrete Mathematics
publication date: 2012-04-13T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6023646
zbMATH Keywords: competition graph
zbMATH Keywords: competition number
zbMATH Keywords: hole
MaRDI profile type: Publication
full work available at URL: j.disc.2011.11.035
OpenAlex ID: W1975902904
Wikidata QID: Q123258876
cites work: The competition number of a graph having exactly one hole
cites work: An upper bound for the competition numbers of graphs
cites work: GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE
cites work: The competition number of a graph whose holes do not overlap much
cites work: The competition number of a graph with exactly \(h\) holes, all of which are independent
cites work: Q4171826
DOI: 10.1016/J.DISC.2011.11.035
description: scientific article; zbMATH DE number 6023646