An upper bound for the competition numbers of graphs

DOI10.1016/J.DAM.2009.09.007MaRDI QIDQ968122zbMATH OpenOpenAlexFDO

Authors 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

competition graphchordal graphcompetition numberhole

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• A sufficient condition for Kim's conjecture on the competition numbers of graphs
• The competition number of a graph whose holes do not overlap much
• Graphs having many holes but with small competition numbers
• Competition numbers, quasi-line graphs, and holes
• The competition number of a graph and the dimension of its hole space

Cites work

• scientific article; zbMATH DE number 3606214 (Why is no real title available?)
• GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE
• On the Computation of the Competition Number of a Graph
• The competition number of a graph having exactly one hole
• The competition number of a graph with exactly \(h\) holes, all of which are independent
• The competition number of a graph with exactly two holes.

Cited in

(8)

• On the hypercompetition numbers of hypergraphs with maximum degree at most two
• The competition number of a graph and the dimension of its hole space
• Graphs having many holes but with small competition numbers
• A mathematical approach on representation of competitions: competition cluster hypergraphs
• scientific article; zbMATH DE number 7034396 (Why is no real title available?)
• A generalization of Opsut's lower bounds for the competition number of a graph
• A sufficient condition for Kim's conjecture on the competition numbers of graphs
• Competition numbers, quasi-line graphs, and holes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968122)