The (1,2)-step competition graph of a tournament
From MaRDI portal
Publication:617643
DOI10.1016/J.DAM.2010.10.008zbMATH Open1225.05109OpenAlexW1998903642MaRDI QIDQ617643FDOQ617643
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
Cites Work
- The competition numbers of complete tripartite graphs
- A characterization of competition graphs
- Connected triangle-free \(m\)-step competition graphs
- 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?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (14)
- 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?)
- The (1, 2)-step competition graph of a hypertournament
- 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
- 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
- The Hamiltonicity on the competition graphs of round digraphs
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)
