Competitively tight graphs

DOI10.1007/s00026-013-0207-4zbMath1284.05226arXiv1112.6203OpenAlexW2133252387MaRDI QIDQ2441380

Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano, Boram Park

Publication date: 24 March 2014

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.6203

zbMATH Keywords

upper boundcompetition graphcompetition numberedge clique covercompetitively tight

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

On the Competition Numbers of Diamond-Free Graphs ⋮ A generalization of Opsut's result on the competition numbers of line graphs

Cites Work

• 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
• Competition numbers of graphs with a small number of triangles
• The competition number of the complement of a cycle
• On the Computation of the Competition Number of a Graph
• Competition Numbers, Quasi-line Graphs, and Holes
• Unnamed Item

This page was built for publication: Competitively tight graphs