On the Competition Numbers of Diamond-Free Graphs

DOI10.1007/978-3-319-48532-4_22zbMath1482.05140OpenAlexW2552055696MaRDI QIDQ2958108

Yoshio Sano

Publication date: 1 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48532-4_22

zbMATH Keywords

competition graphdiamond-free graphcompetition numberedge clique coveressential vertex

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• A generalization of Opsut's lower bounds for the competition number of a graph
• A generalization of Opsut's result on the competition numbers of line graphs
• Competitively tight graphs
• On the Computation of the Competition Number of a Graph
• Competition Numbers, Quasi-line Graphs, and Holes
• The competition number of a generalized line graph is at most two

This page was built for publication: On the Competition Numbers of Diamond-Free Graphs