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

DOI10.1016/J.DAM.2010.10.008zbMATH Open1225.05109OpenAlexW1998903642MaRDI QIDQ617643FDOQ617643

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

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

zbMATH Keywords

competition graphdigraphtournament\(m\)-step graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cites Work

• The competition numbers of complete tripartite graphs
• A characterization of competition graphs
• Connected triangle-free \(m\)-step competition graphs
• Title not available (Why is that?)
• An introduction to \((1,2)\)-domination graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The \(m\)-step competition graph of a digraph
• \((i,j)\) competition graphs
• The domination and competition graphs of a tournament
• Title not available (Why is that?)

Cited In (21)

• Title not available (Why is that?)
• The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable
• On the phylogeny graphs of degree-bounded digraphs
• Title not available (Why is that?)
• 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
• Digraphs whose \(m\)-step competition graphs are trees
• A class of local tournaments with interval \((1,2)\)-step competition graphs
• A complete characterization of paths that are \(m\)-step competition graphs
• 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
• Title not available (Why is that?)

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)