Pages that link to "Item:Q1765515"

The following pages link to Connected triangle-free \(m\)-step competition graphs (Q1765515):

Displaying 13 items.

• The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable (Q266961) (← links)
• The (1,2)-step competition graph of a tournament (Q617643) (← links)
• A complete characterization of paths that are \(m\)-step competition graphs (Q642960) (← links)
• Characterizing paths as \(m\)-step competition graphs (Q708427) (← links)
• The competition number of a graph whose holes do not overlap much (Q987698) (← links)
• Note on the \(m\)-step competition numbers of paths and cycles (Q1026165) (← links)
• A matrix sequence \(\{\Gamma (A^m)\}^\infty_{m=1}\) might converge even if the matrix \(A\) is not primitive (Q1938687) (← links)
• The (1, 2)-step competition graph of a hypertournament (Q2053626) (← links)
• On \(m\)-step competition graphs of bipartite tournaments (Q2192078) (← links)
• On the matrix sequence \(\{\Gamma(A^m)\}_{m=1}^\infty\) for a Boolean matrix \(A\) whose digraph is linearly connected (Q2448228) (← links)
• The \(m\)-step, same-step, and any-step competition graphs (Q2576346) (← links)
• On the limit of the sequence \(\{ C^m ( D ) \}_{m = 1}^\infty\) for a multipartite tournament \(D\) (Q6094707) (← links)
• Digraphs whose \(m\)-step competition graphs are trees (Q6110613) (← links)