Pages that link to "Item:Q2576849"

The following pages link to The competition number of a graph having exactly one hole (Q2576849):

Displaying 9 items.

• A sufficient condition for Kim's conjecture on the competition numbers of graphs (Q409447) (← links)
• The competition number of a graph and the dimension of its hole space (Q427694) (← links)
• The competition number of a graph with exactly two holes (Q434196) (← links)
• Graphs having many holes but with small competition numbers (Q540279) (← links)
• Competition numbers of complete \(r\)-partite graphs (Q713323) (← links)
• A mathematical approach on representation of competitions: competition cluster hypergraphs (Q778654) (← links)
• An upper bound for the competition numbers of graphs (Q968122) (← links)
• The competition number of a graph whose holes do not overlap much (Q987698) (← links)
• The competition number of a graph with exactly \(h\) holes, all of which are independent (Q1028099) (← links)