An upper bound for the competition numbers of graphs

DOI10.1016/J.DAM.2009.09.007zbMath1226.05144OpenAlexW1986957580MaRDI QIDQ968122

Akira Kamibeppu

Publication date: 5 May 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.09.007

zbMATH Keywords

holechordal graphcompetition graphcompetition number

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (2)

A sufficient condition for Kim's conjecture on the competition numbers of graphs ⋮ The competition number of a graph and the dimension of its hole space

Cites Work

• Unnamed Item
• Unnamed Item
• The competition number of a graph with exactly \(h\) holes, all of which are independent
• The competition number of a graph having exactly one hole
• GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE
• On the Computation of the Competition Number of a Graph

This page was built for publication: An upper bound for the competition numbers of graphs