The competition number of a graph whose holes do not overlap much

DOI10.1016/j.dam.2010.04.004zbMath1209.05110OpenAlexW1968365630MaRDI QIDQ987698

Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano

Publication date: 13 August 2010

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

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

zbMATH Keywords

holecompetition graphcompetition number

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

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 ⋮ Graphs having many holes but with small competition numbers ⋮ The competition numbers of ternary Hamming graphs ⋮ Competition numbers of complete \(r\)-partite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The competition numbers of complete tripartite graphs
• Note on the \(m\)-step competition numbers of paths and cycles
• The competition number of a graph with exactly \(h\) holes, all of which are independent
• Competition numbers of graphs with a small number of triangles
• Connected triangle-free \(m\)-step competition graphs
• The elimination procedure for the competition number is not optimal
• The \(m\)-step, same-step, and any-step competition graphs
• 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: The competition number of a graph whose holes do not overlap much