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

DOI10.1016/J.DAM.2010.10.008MaRDI QIDQ617643zbMATH OpenOpenAlexFDO

Authors K. A. S. Factor, S. K. Merz

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

competition graphdigraphtournament\(m\)-step graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• The (1, 2)-step competition graph of a hypertournament
• The (1, 2)-step competition graph of a pure local tournament that is not round decomposable
• The \(m\)-step competition graph of a digraph
• On \(m\)-step competition graphs of bipartite tournaments
• scientific article; zbMATH DE number 7071939

Cites work

• scientific article; zbMATH DE number 4149959 (Why is no real title available?)
• scientific article; zbMATH DE number 3606214 (Why is no real title available?)
• scientific article; zbMATH DE number 1498519 (Why is no real title available?)
• scientific article; zbMATH DE number 2188417 (Why is no real title available?)
• scientific article; zbMATH DE number 3303831 (Why is no real title available?)
• A characterization of competition graphs
• An introduction to \((1,2)\)-domination graphs
• Connected triangle-free \(m\)-step competition graphs
• The \(m\)-step competition graph of a digraph
• The competition numbers of complete tripartite graphs
• The domination and competition graphs of a tournament
• \((i,j)\) competition graphs

Cited in

(21)

• The (1, 2)-step competition graph of a pure local tournament that is not round decomposable
• scientific article; zbMATH DE number 6277695 (Why is no real title available?)
• On the phylogeny graphs of degree-bounded digraphs
• scientific article; zbMATH DE number 7071939 (Why is no real title available?)
• Connected triangle-free \(m\)-step competition graphs
• On the trees whose 2-step competition numbers are two.
• The (1, 2)-step competition graph of a hypertournament
• On \(m\)-step competition graphs of bipartite tournaments
• On \((1, 2)\)-step competition graphs of bipartite tournaments
• A generalization of Opsut's result on the competition numbers of line graphs
• A complete characterization of paths that are m-step competition graphs
• A class of local tournaments with interval \((1,2)\)-step competition graphs
• Digraphs whose \(m\)-step competition graphs are trees
• Characterizing paths as \(m\)-step competition graphs
• A mathematical approach on representation of competitions: competition cluster hypergraphs
• The \(m\)-step competition graph of a digraph
• The partial order competition dimensions of bipartite graphs
• The niche graphs of bipartite tournaments
• A note on the existence of edges in the \((1, 2)\)-step competition graph of a round digraph
• The Hamiltonicity on the competition graphs of round digraphs
• scientific article; zbMATH DE number 4063115 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q617643)