Pages that link to "Item:Q617643"

The following pages link to The (1,2)-step competition graph of a tournament (Q617643):

Displaying 11 items.

• The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable (Q266961) (← links)
• A generalization of Opsut's result on the competition numbers of line graphs (Q479034) (← links)
• Characterizing paths as \(m\)-step competition graphs (Q708427) (← links)
• A mathematical approach on representation of competitions: competition cluster hypergraphs (Q778654) (← links)
• The partial order competition dimensions of bipartite graphs (Q1720310) (← links)
• The (1, 2)-step competition graph of a hypertournament (Q2053626) (← links)
• The niche graphs of bipartite tournaments (Q2185734) (← links)
• On \((1, 2)\)-step competition graphs of bipartite tournaments (Q2410227) (← links)
• On the phylogeny graphs of degree-bounded digraphs (Q2410253) (← links)
• The Hamiltonicity on the competition graphs of round digraphs (Q2422588) (← links)
• Digraphs whose \(m\)-step competition graphs are trees (Q6110613) (← links)