A generalization of Opsut's lower bounds for the competition number of a graph

DOI10.1007/s00373-012-1188-5zbMath1272.05066arXiv1205.4322OpenAlexW3099615988MaRDI QIDQ367054

Yoshio Sano

Publication date: 26 September 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

competition graphcompetition numberedge clique cover numbervertex clique cover number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

On the Competition Numbers of Diamond-Free Graphs ⋮ Competitively tight graphs ⋮ Competition numbers of complete \(r\)-partite graphs

Cites Work

• Unnamed Item
• The competition numbers of complete multipartite graphs with many partite sets
• The competition numbers of ternary Hamming graphs
• Applications of edge coverings by cliques
• The competition numbers of complete tripartite graphs
• The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares
• A characterization of competition graphs
• A characterization of graphs of competition number m
• A characterization of competition graphs of arbitrary digraphs
• Competition numbers of graphs with a small number of triangles
• The competition number of the complement of a cycle
• The competition numbers of Johnson graphs
• THE COMPETITION NUMBERS OF HAMMING GRAPHS WITH DIAMETER AT MOST THREE
• The competition numbers of regular polyhedra
• On the Computation of the Competition Number of a Graph

This page was built for publication: A generalization of Opsut's lower bounds for the competition number of a graph