On \((1, 2)\)-step competition graphs of bipartite tournaments

DOI10.1016/J.DAM.2017.08.004zbMath1372.05086arXiv1611.01901OpenAlexW2963936334MaRDI QIDQ2410227

Soogang Eoh, Suh-Ryung Kim, Sojung Lee, Jihoon Choi

Publication date: 17 October 2017

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

Full work available at URL: https://arxiv.org/abs/1611.01901

zbMATH Keywords

bipartite tournament\((1, 2)\)-step competition graphs\((1, 2)\)-step competition-realizableorientation of complete bipartite graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Competitively orientable complete multipartite graphs

Cites Work

• The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable
• A sufficient condition for Kim's conjecture on the competition numbers of graphs
• A generalization of Opsut's result on the competition numbers of line graphs
• The (1,2)-step competition graph of a tournament
• Competition numbers of complete \(r\)-partite graphs
• The competition graphs of oriented complete bipartite graphs
• The competition-common enemy graph of a digraph
• Niche graphs
• The \(m\)-step competition graph of a digraph
• \(p\)-competition graphs
• Transversals and competition numbers of complete multipartite graphs
• Competition Numbers, Quasi-line Graphs, and Holes
• Unnamed Item
• Unnamed Item

This page was built for publication: On \((1, 2)\)-step competition graphs of bipartite tournaments