The competition number of a graph and the dimension of its hole space

DOI10.1016/J.AML.2011.10.003zbMath1243.05096arXiv1103.1028OpenAlexW2010924695MaRDI QIDQ427694

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

Publication date: 14 June 2012

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

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

zbMATH Keywords

cycle spaceholecompetition graphcompetition numberhole space

Mathematics Subject Classification ID

Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Competitively tight graphs

Cites Work

• The competition numbers of complete multipartite graphs with many partite sets
• Graphs having many holes but with small competition numbers
• An upper bound for the competition numbers of 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
• Competition numbers of graphs with a small number of triangles
• The competition number of a graph having exactly one hole
• GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE
• On the Computation of the Competition Number of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The competition number of a graph and the dimension of its hole space