The (1,2)-step competition graph of a tournament

DOI10.1016/J.DAM.2010.10.008zbMath1225.05109OpenAlexW1998903642MaRDI QIDQ617643

Sarah K. Merz, Kim A. S. Factor

Publication date: 21 January 2011

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

Full work available at URL: https://doi.org/10.1016/j.dam.2010.10.008

zbMATH Keywords

digraphtournamentcompetition graph\(m\)-step graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable ⋮ On \((1, 2)\)-step competition graphs of bipartite tournaments ⋮ On the phylogeny graphs of degree-bounded digraphs ⋮ The niche graphs of bipartite tournaments ⋮ The Hamiltonicity on the competition graphs of round digraphs ⋮ Digraphs whose \(m\)-step competition graphs are trees ⋮ The partial order competition dimensions of bipartite graphs ⋮ A generalization of Opsut's result on the competition numbers of line graphs ⋮ The (1, 2)-step competition graph of a hypertournament ⋮ A mathematical approach on representation of competitions: competition cluster hypergraphs

Cites Work

• The competition numbers of complete tripartite graphs
• A characterization of competition graphs
• \((i,j)\) competition graphs
• The \(m\)-step competition graph of a digraph
• Connected triangle-free \(m\)-step competition graphs
• The domination and competition graphs of a tournament
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The (1,2)-step competition graph of a tournament