The competition number of a graph having exactly one hole

DOI10.1016/j.disc.2004.12.016zbMath1079.05041OpenAlexW1967603603MaRDI QIDQ2576849

Han Hyuk Cho, Suh-Ryung Kim

Publication date: 29 December 2005

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

Full work available at URL: https://doi.org/10.1016/j.disc.2004.12.016

zbMATH Keywords

chordal graphcompetition graphchordless cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (9)

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 ⋮ Competition numbers of complete \(r\)-partite graphs ⋮ The competition number of a graph whose holes do not overlap much ⋮ The competition number of a graph with exactly \(h\) holes, all of which are independent ⋮ A mathematical approach on representation of competitions: competition cluster hypergraphs

Cites Work

• On rigid circuit graphs
• The competition-common enemy graph of a digraph
• Niche graphs
• Competition numbers of graphs with a small number of triangles
• Niche numbers
• On the Computation of the Competition Number of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The competition number of a graph having exactly one hole