Competition numbers of graphs with a small number of triangles

DOI10.1016/S0166-218X(97)00026-7zbMath0889.05057OpenAlexW2053270673MaRDI QIDQ1377663

Suh-Ryung Kim, Fred S. Roberts

Publication date: 11 June 1998

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

connected graphstrianglescompetition graphacyclic digraphcompetition number

Mathematics Subject Classification ID

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

Related Items (14)

A generalization of Opsut's lower bounds for the competition number of a graph ⋮ The competition number of a graph and the dimension of its hole space ⋮ The competition number of a graph with exactly two holes ⋮ Competitively tight graphs ⋮ Characterizing paths as \(m\)-step competition graphs ⋮ Competition numbers of complete \(r\)-partite graphs ⋮ The elimination procedure for the competition number is not optimal ⋮ The competition number of a graph whose holes do not overlap much ⋮ Phylogeny numbers ⋮ 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 ⋮ Phylogeny numbers for graphs with two triangles ⋮ The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares ⋮ The competition number of a graph having exactly one hole

Cites Work

• A characterization of competition graphs
• A characterization of competition graphs of arbitrary digraphs
• The competition-common enemy graph of a digraph
• Niche graphs
• Niche numbers
• On the Computation of the Competition Number of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Competition numbers of graphs with a small number of triangles