The competition number of a graph with exactly \(h\) holes, all of which are independent

DOI10.1016/j.dam.2008.11.004zbMath1204.05050OpenAlexW2010037440MaRDI QIDQ1028099

Bo-Jr Li, Gerard Jennhwa Chang

Publication date: 30 June 2009

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

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

zbMATH Keywords

holechordal graphcompetition graphcompetition numberchordless cycleindependent hole

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items

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, The competition number of a graph with exactly two holes, Graphs having many holes but with small competition numbers, An upper bound for the competition numbers of graphs, The competition numbers of ternary Hamming graphs, Characterizing paths as \(m\)-step competition graphs, Competition numbers of complete \(r\)-partite graphs, The competition number of a graph whose holes do not overlap much

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• The competition-common enemy graph of a digraph
• Niche graphs
• Competition numbers of graphs with a small number of triangles
• The competition number of a graph having exactly one hole
• GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE
• Niche numbers
• On the Computation of the Competition Number of a Graph